New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (3) , 721-729
- https://doi.org/10.1109/18.79942
Abstract
New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm. They state and prove some asymptotic bounds on the compression ratio that the improved algorithm achieves. For completeness, they describe the Lempel-Ziv-Welch data compression algorithm presented by T. A. Welch (1984). A software implementation for both the original and the improved Lempel-Ziv algorithms is given, and the algorithms are compared with each other as well as with the Lempel-Ziv-Welch algorithm.<>Keywords
This publication has 9 references indexed in Scilit:
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compressionIEEE Transactions on Information Theory, 1989
- A Technique for High-Performance Data CompressionComputer, 1984
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Arithmetic CodingIBM Journal of Research and Development, 1979
- Variations on a theme by HuffmanIEEE Transactions on Information Theory, 1978
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952