Redundancy estimates for the Lempel–Ziv algorithm of data compression

DOI10.1016/S0166-218X(02)00308-6zbMath0930.94016MaRDI QIDQ4936548

Vladimir N. Potapov

Publication date: 31 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

data compressioncodingLempel-Ziv code

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Cites Work

• Unnamed Item
• Unnamed Item
• Codes and information
• Linear Algorithm for Data Compression via String Matching
• Data compression via textual substitution
• Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
• Universal codeword sets and representations of the integers
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• On the average redundancy rate of the Lempel-Ziv code
• Redundancy of the Lempel-Ziv incremental parsing rule
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
• Redundancy of the Lempel-Ziv string matching code
• Improved redundancy of a version of the Lempel-Ziv algorithm
• Text and hypertext compression

This page was built for publication: Redundancy estimates for the Lempel–Ziv algorithm of data compression