Redundancy of the Lempel-Ziv incremental parsing rule

DOI10.1109/18.567642zbMath0874.94027OpenAlexW2148107416MaRDI QIDQ4336281

S. A. Savari

Publication date: 12 May 1997

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

Full work available at URL: https://semanticscholar.org/paper/1a1802ad28edd19e073b4105125b08a65f9a424d

zbMATH Keywords

data compressionrenewal theoryredundancyMarkov sourceLempel-Ziv codes

Mathematics Subject Classification ID

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

Related Items (5)

Reducing coding redundancy in LZW ⋮ 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 ⋮ Sensor networks: from dependence analysis via matroid bases to online synthesis ⋮ On the Value of Multiple Read/Write Streams for Data Compression

This page was built for publication: Redundancy of the Lempel-Ziv incremental parsing rule