Redundancy of the Lempel-Ziv string matching code
From MaRDI portal
Publication:4400291
DOI10.1109/18.661522zbMath0912.94010OpenAlexW2095631359MaRDI QIDQ4400291
Publication date: 26 May 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.661522
Related Items (3)
On optimal parsing for LZ78-like compressors ⋮ Redundancy estimates for the Lempel–Ziv algorithm of data compression ⋮ Data compression and learning in time sequences analysis
This page was built for publication: Redundancy of the Lempel-Ziv string matching code
