On the bit-complexity of Lempel-Ziv compression
From MaRDI portal
Publication:2862201
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Abstract: One of the most famous and investigated lossless data-compression scheme is the one introduced by Lempel and Ziv about 40 years ago. This compression scheme is known as "dictionary-based compression" and consists of squeezing an input string by replacing some of its substrings with (shorter) codewords which are actually pointers to a dictionary of phrases built as the string is processed. Surprisingly enough, although many fundamental results are nowadays known about upper bounds on the speed and effectiveness of this compression process and references therein), ``we are not aware of any parsing scheme that achieves optimality when the LZ77-dictionary is in use under any constraint on the codewords other than being of equal length [N. Rajpoot and C. Sahinalp. Handbook of Lossless Data Compression, chapter Dictionary-based data compression. Academic Press, 2002. pag. 159]. Here optimality means to achieve the minimum number of bits in compressing each individual input string, without any assumption on its generating source. In this paper we provide the first LZ-based compressor which computes the bit-optimal parsing of any input string in efficient time and optimal space, for a general class of variable-length codeword encodings which encompasses most of the ones typically used in data compression and in the design of search engines and compressed indexes.
Recommendations
Cited in
(28)- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
- The greedy approach to dictionary-based static text compression on a distributed system
- Dictionary-symbolwise flexible parsing
- Bidirectional Text Compression in External Memory
- On Optimally Partitioning a Text to Improve Its Compression
- Compression estimates for a class of dictionary based compressors
- Comparison of LZ77-type parsings
- scientific article; zbMATH DE number 975330 (Why is no real title available?)
- On the approximation ratio of Lempel-Ziv parsing
- Lempel-Ziv: a ``one-bit catastrophe but not a tragedy
- On the Hardness of Finding Optimal Multiple Preset Dictionaries
- Compression in the presence of shared data
- Lempel-Ziv-like parsing in small space
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- scientific article; zbMATH DE number 1542846 (Why is no real title available?)
- Data compression with long repeated strings
- Relations between greedy and bit-optimal LZ77 encodings
- On the bit-complexity of Lempel-Ziv compression
- Lempel-Ziv Compression in a Sliding Window
- Bicriteria data compression
- Fast gapped variants for Lempel-Ziv-Welch compression
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
- Space-Conscious Compression
- Compressing big data: when the rate of convergence to the entropy matters
- A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- New advances in rightmost Lempel-Ziv
- Sublinear time Lempel-Ziv (LZ77) factorization
This page was built for publication: On the bit-complexity of Lempel-Ziv compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862201)
