On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources

DOI10.1109/18.605570MaRDI QIDQ4345604zbMATH OpenOpenAlexFDO

Authors Enhui Yang, John C. Kieffer

Publication date 18 September 1997

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

Full work available at URL https://doi.org/10.1109/18.605570

zbMATH Keywords

data compressionentropy rate\(\phi\)-mixing sourcesfixed-database Lempel-Ziv algorithmvariable-length to variable-length codes

Mathematics Subject Classification ID

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

Recommendations

• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
• Improved redundancy of a version of the Lempel-Ziv algorithm
• On the average redundancy rate of the Lempel-Ziv code
• Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm

Cited in

(2)

• Improved redundancy of a version of the Lempel-Ziv algorithm
• On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm

This page was built for publication: On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345604)