Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
From MaRDI portal
Publication:3991388
DOI10.1109/18.108250zbMath0745.94004OpenAlexW2116952242MaRDI QIDQ3991388
Jacob Ziv, Marcelo J. Weinberger, Eli Plotnik
Publication date: 28 June 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.108250
Related Items (6)
On compressing and indexing repetitive sequences ⋮ Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees ⋮ Optimal encoding of non-stationary sources ⋮ Redundancy estimates for the Lempel–Ziv algorithm of data compression ⋮ Optimal data compression algorithm ⋮ Universal Data Compression Algorithm Based on Approximate String Matching
This page was built for publication: Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
