Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments

DOI10.1109/TIT.2007.894689MaRDI QIDQ3548234zbMATH OpenFDO

Authors Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward

Publication date 21 December 2008

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

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

zbMATH Keywords

Autocorrelation polynomialcombinatorics on wordsdepoissonizationjoint source-channel codingLempel-Ziv'77 (LZ'77) schemeMellin transformmultiple matchespattern matchingReed-Solomon (RS) codesuffix treestries

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Source coding (94A29)

Recommendations

• On the average redundancy rate of the Lempel-Ziv code with the k-error protocol
• Error-Resilient Optimal Data Compression
• On the average redundancy rate of the Lempel-Ziv code
• Improved redundancy of a version of the Lempel-Ziv algorithm
• Redundancy of the Lempel-Ziv string matching code

Cited in

(4)

• A separation between RLSLPs and LZ77
• On the shape of the fringe of various types of random trees
• Error-Resilient Optimal Data Compression
• On the average redundancy rate of the Lempel-Ziv code with the k-error protocol

This page was built for publication: Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments

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