Fixed data base version of the Lempel-Ziv data compression algorithm
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 202-207
- https://doi.org/10.1109/dcc.1991.213361
Abstract
It is demonstrated that a variant of the algorithm, where the data base is held fixed and is reused to encode successive strings of incoming input symbols, is optimal provided that the source is stationary and satisfies certain conditions (e.g. a finite-order Markov source) Author(s) Wyner, A.D. AT&T Bell Labs., Murray Hill, NJ, USA Ziv, J.Keywords
This publication has 3 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
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978