Data compression with finite windows
- 1 April 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 32 (4), 490-505
- https://doi.org/10.1145/63334.63341
Abstract
Several methods are presented for adaptive, invertible data compression in the style of Lempel's and Ziv's first textual substitution proposal. For the first two methods, the article describes modifications of McCreight's suffix tree data structure that support cyclic maintenance of a window on the most recent source characters. A percolating update is used to keep node positions within the window, and the updating process is shown to have constant amortized cost. Other methods explore the tradeoffs between compression time, expansion time, data structure size, and amount of compression achieved. The article includes a graph-theoretic analysis of the compression penalty incurred by our codeword selection policy in comparison with an optimal policy, and it includes empirical studies of the performance of various adaptive compressors from the literature.Keywords
This publication has 30 references indexed in Scilit:
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- Compression of character strings by an adaptive dictionaryBIT Numerical Mathematics, 1985
- Dynamic huffman codingJournal of Algorithms, 1985
- Data compression via textual substitutionJournal of the ACM, 1982
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- Economical encoding of commas between stringsCommunications of the ACM, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Run-length encodings (Corresp.)IEEE Transactions on Information Theory, 1966