Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 29 (3) , 893-911
- https://doi.org/10.1137/s0097539797331105
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- On the average redundancy rate of the Lempel-Ziv codeIEEE Transactions on Information Theory, 1997
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search treesTheoretical Computer Science, 1995
- On asymptotic optimality of a sliding window variation of Lempel-Ziv codesIEEE Transactions on Information Theory, 1993
- Exact analysis of the Lempel-Ziv algorithm for i.i.d. sourcesIEEE Transactions on Information Theory, 1993
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithmIEEE Transactions on Information Theory, 1992
- New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithmIEEE Transactions on Information Theory, 1991
- Modeling for text compressionACM Computing Surveys, 1989
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981