Corpus ID: 203627031

A Self-contained Analysis of the Lempel-Ziv Compression Algorithm

@article{Sudan2019ASA,
  title={A Self-contained Analysis of the Lempel-Ziv Compression Algorithm},
  author={M. Sudan and D. Xiang},
  journal={ArXiv},
  year={2019},
  volume={abs/1910.00941}
}
  • M. Sudan, D. Xiang
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • This article gives a self-contained analysis of the performance of the Lempel-Ziv compression algorithm on (hidden) Markovian sources. Specifically we include a full proof of the assertion that the compression rate approaches the entropy rate of the chain being compressed. 

    Topics from this paper

    References

    SHOWING 1-9 OF 9 REFERENCES
    A universal algorithm for sequential data compression
    • 5,236
    • PDF
    On the Complexity of Finite Sequences
    • 2,076
    Compression of individual sequences via variable-rate coding
    • 3,403
    • PDF
    Elements of Information Theory
    • 40,346
    • PDF
    Probability and computing: randomized algorithms and probabilistic analysis
    • 944
    • PDF
    Markov Chains and Mixing Times
    • 1,446
    • PDF
    Randomized Algorithms
    • 481
    • PDF
    Lempel-Ziv sliding window universal compression. Available at http://mit.edu/6.441/spring06/handout/sup/6.441 LZ 77
    • Notes 2b.doc,
    • 1994
    Lempel-Ziv sliding window universal compression. Available at http://mit.edu/6.441/spring06/handout/sup/6.441 LZ 77
    • Notes 2b.doc,
    • 1994