On the average redundancy rate of the Lempel-Ziv code

DOI10.1109/18.567640zbMath0873.94009OpenAlexW1968884246MaRDI QIDQ4336280

Wojciech Szpankowski, Guy Louchard

Publication date: 5 November 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/1223

zbMATH Keywords

data compressionaverage redundancy rate\(k\)-th moment of number of phrasesLempel-Ziv codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (5)

Analytical depoissonization and its applications ⋮ Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ D?E?K=(1000)8 ⋮ On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol ⋮ Redundancy estimates for the Lempel–Ziv algorithm of data compression

This page was built for publication: On the average redundancy rate of the Lempel-Ziv code