Lempel-Ziv Dimension for Lempel-Ziv Compression

DOI10.1007/11821069_60MaRDI QIDQ5756683zbMATH OpenOpenAlexFDO

Authors María López-Valdés

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_60

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Performance of LZ algorithms on individual sequences
• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
• Bounded pushdown dimension vs Lempel Ziv information density
• Dimension is compression

Cited in

(9)

• Dimension is compression
• Bounded pushdown dimension vs Lempel Ziv information density
• A linearly computable measure of string complexity
• Lempel-Ziv: a ``one-bit catastrophe but not a tragedy
• Performance of LZ algorithms on individual sequences
• scientific article; zbMATH DE number 1927204 (Why is no real title available?)
• Lempel-Ziv Compression in a Sliding Window
• Mathematical Foundations of Computer Science 2005
• A normal sequence compressed by PPM* but not by Lempel-Ziv 78

This page was built for publication: Lempel-Ziv Dimension for Lempel-Ziv Compression

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