The Lempel-Ziv algorithm and message complexity
From MaRDI portal
Publication:4024568
DOI10.1109/18.165463zbMath0775.94077OpenAlexW2055570934MaRDI QIDQ4024568
Publication date: 4 February 1993
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.165463
Related Items (5)
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees ⋮ Inverted rank distributions: macroscopic statistics, universality classes, and critical exponents ⋮ On the distribution function of the complexity of finite sequences ⋮ Optimal data compression algorithm ⋮ Universal Data Compression Algorithm Based on Approximate String Matching
This page was built for publication: The Lempel-Ziv algorithm and message complexity
