Lempel-Ziv: a ``one-bit catastrophe but not a tragedy

MaRDI QIDQ4607986zbMATH OpenFDO

Authors Guillaume Lagarde, Sylvain Perifel

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1707.04312, http://dl.acm.org/citation.cfm?id=3175402

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• A normal sequence compressed by PPM* but not by Lempel-Ziv 78
• On the bit-complexity of Lempel-Ziv compression
• On the bit-complexity of Lempel-Ziv compression
• Lempel-Ziv Dimension for Lempel-Ziv Compression

Cited in

(4)

• Novel results on the number of runs of the Burrows-Wheeler-transform
• Pushdown and Lempel-Ziv depth
• Bit catastrophes for the Burrows-Wheeler transform
• Sensitivity of string compressors and repetitiveness measures

This page was built for publication: Lempel-Ziv: a ``one-bit catastrophe but not a tragedy

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