On the average redundancy rate of the Lempel-Ziv code

DOI10.1109/18.567640MaRDI QIDQ4336280zbMATH OpenOpenAlexFDO

Authors 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 compression\(k\)-th moment of number of phrasesaverage redundancy rateLempel-Ziv codes

Mathematics Subject Classification ID

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

Recommendations

• Redundancy of the Lempel-Ziv incremental parsing rule
• Improved redundancy of a version of the Lempel-Ziv algorithm
• 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
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

Cited in

(9)

• Redundancy estimates for the Lempel–Ziv algorithm of data compression
• Analytical depoissonization and its applications
• \(D\cdot E\cdot K=(100)_8\)
• On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
• scientific article; zbMATH DE number 6683480 (Why is no real title available?)
• Average Redundancy of the Shannon Code for Markov Sources
• scientific article; zbMATH DE number 1927204 (Why is no real title available?)
• Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments
• Gaussian distribution of trie depth for strongly tame sources

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

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