Fixed data base version of 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) , 878-880
- https://doi.org/10.1109/18.79955
Abstract
It is demonstrated that a variant of the Lempel-Ziv data compression algorithm where the database 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). A finite memory version of the Lempel-Ziv algorithm compresses (on the average) to about the entropy rate. The necessary memory size depends on the nature of the source.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