Redundancy estimates for the Lempel–Ziv algorithm of data compression

DOI10.1016/S0166-218X(02)00308-6MaRDI QIDQ4936548zbMATH OpenFDO

Authors Vladimir N. Potapov

Publication date 31 January 2000

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

Full work available at URL https://doi.org/10.1016/S0166-218X(02)00308-6

zbMATH Keywords

data compressioncodingLempel-Ziv code

Mathematics Subject Classification ID

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

Recommendations

• Improved redundancy of a version of the Lempel-Ziv algorithm
• On the average redundancy rate of the Lempel-Ziv code
• Problems of robustness for universal coding schemes
• Redundancy of the Lempel-Ziv incremental parsing rule
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

Cites work

• scientific article; zbMATH DE number 4045113 (Why is no real title available?)
• scientific article; zbMATH DE number 3326139 (Why is no real title available?)
• A universal algorithm for sequential data compression
• Codes and information
• Compression of individual sequences via variable-rate coding
• Data compression via textual substitution
• Improved redundancy of a version of the Lempel-Ziv algorithm
• Linear Algorithm for Data Compression via String Matching
• On the average redundancy rate of the Lempel-Ziv code
• Redundancy of the Lempel-Ziv incremental parsing rule
• Redundancy of the Lempel-Ziv string matching code
• Text and hypertext compression
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
• Universal codeword sets and representations of the integers
• Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm

Cited in

(14)

• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• Reducing coding redundancy in LZW
• Entropy and data compression schemes
• scientific article; zbMATH DE number 3353133 (Why is no real title available?)
• scientific article; zbMATH DE number 975330 (Why is no real title available?)
• scientific article; zbMATH DE number 3621627 (Why is no real title available?)
• An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
• Improved redundancy of a version of the Lempel-Ziv algorithm
• scientific article; zbMATH DE number 1927204 (Why is no real title available?)
• Problems of robustness for universal coding schemes
• Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
• A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
• Formulae to calculate distributions of the Lempel-Ziv statistics and related statistics
• Redundancy of Lossless Data Compression for Known Sources by Analytic Methods

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

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