Variations on a theme by Ziv and Lempel
The data compression methods of Ziv and Lempel are modified and augmented, in three ways in order to improve the compression ratio, and hold the size of the encoding tables to a fixed size. The improvements are in the area of dispensing with any uncompressed output, ability to use fixed size encoding tables by using a replacement strategy, and more rapid adaptation by widening the class of strings which may be added to the dictionary. Following Langdon, we show how these improvements also provide an adaptive probabilistic model for the input data. The issue of data structures for efficient implementation is also addressed.
KeywordsCompression Ratio Hash Table Replacement Strategy Dictionary Entry Arithmetic Code
Unable to display preview. Download preview PDF.
- E. Gilbert and C. Momna, Multigram Codes, IEEE Trans. Inform. Theory, IT-28 (1982), 346–348Google Scholar
- G. Langdon, A Note on the Ziv-Lempel Model for Compressing Individual sequences, IEEE Trans. Inform. Theory, IT-29 (1983), 285–287Google Scholar
- G. Langdon, A Double Adaptive File Compression Algorithm, IEEE Trans. Commun., COM-3I (1983), 1253–1255Google Scholar
- J. Rissanen and G. Langdon, Universal Modeling and Coding, IEEE Trans. Inform. Theory, IT-24 (1981), 12–23Google Scholar
- J. Ziv, Coding Theorems for Individual Sequences, IEEE Trans. Inform. Theory, IT-24 (1978), 405–412Google Scholar
- J. Ziv and A. Lempel, A Universal algorithm for Sequential Data Compression, IEEE Trans. Inform. Theory, IT-23 (1976), 75–81Google Scholar
- J. Ziv and A. Lempel, Compression of Individual Sequences via Variable-rate Coding, IEEE Trans. Inform. Theory, IT-24 (1978), 530–536Google Scholar