The sliding-window Lempel-Ziv algorithm is asymptotically optimal
- 1 June 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 82 (6) , 872-877
- https://doi.org/10.1109/5.286191
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Fixed data base version of the Lempel-Ziv data compression algorithmIEEE Transactions on Information Theory, 1991
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compressionIEEE Transactions on Information Theory, 1989
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977