论文信息 - The effect of non-greedy parsing in Ziv-Lempel compression methods

The effect of non-greedy parsing in Ziv-Lempel compression methods

Most practical compression methods in the LZ77 and LZ78 families parse their input using a greedy heuristic. However the popular gzip compression program demonstrates that modest but significant gains in compression performance are possible if non-greedy parsing is used. Practical implementations for using non-greedy parsing in LZ77 and LZ78 compression are explored and some experimental measurements are presented.

R. Nigel Horspool

[1] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[2] Ian H. Witten,et al. Text Compression , 1990, 125 Problems in Text Algorithms.

[3] Ian H. Witten,et al. The relationship between greedy parsing and symbolwise text compression , 1994, JACM.

[4] James A. Storer,et al. Parallel algorithms for data compression , 1985, JACM.

[5] R. Nigel Horspool. Improving LZW (data compression algorithm) , 1991, [1991] Proceedings. Data Compression Conference.

[6] Terry A. Welch,et al. A Technique for High-Performance Data Compression , 1984, Computer.

[7] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[8] James A. Storer,et al. Data Compression: Methods and Theory , 1987 .

[9] H. S. Heaps,et al. A comparison of algorithms for data base compression by use of fragments as language elements , 1974, Inf. Storage Retr..