The Lempel-Ziv algorithm and message complexity

DOI10.1109/18.165463MaRDI QIDQ4024568zbMATH OpenOpenAlexFDO

Authors E. N. Gilbert, T. T. Kadota

Publication date 4 February 1993

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(5)

• On the distribution function of the complexity of finite sequences
• Inverted rank distributions: macroscopic statistics, universality classes, and critical exponents
• Optimal data compression algorithm
• Universal Data Compression Algorithm Based on Approximate String Matching
• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees

This page was built for publication: The Lempel-Ziv algorithm and message complexity

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