On the bit-complexity of Lempel-Ziv compression
zbMATH Open1421.68043MaRDI QIDQ4633889FDOQ4633889
Authors: Paolo Ferragina, Igor Nitto, Rossano Venturini 
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496854
Recommendations
- On the bit-complexity of Lempel-Ziv compression
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- On two LZ78-style grammars: compression bounds and compressed-space computation
- A worst-case analysis of the LZ2 compression algorithm
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)
Cited In (20)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Dictionary-symbolwise flexible parsing
- Compression estimates for a class of dictionary based compressors
- Title not available (Why is that?)
- On the bit-complexity of Lempel-Ziv compression
- Lempel-Ziv: a ``one-bit catastrophe but not a tragedy
- On the Hardness of Finding Optimal Multiple Preset Dictionaries
- On optimal parsing for LZ78-like compressors
- Compression in the presence of shared data
- Note on the greedy parsing optimality for dictionary-based text compression
- Data compression with long repeated strings
- Relations between greedy and bit-optimal LZ77 encodings
- Lempel-Ziv Compression in a Sliding Window
- Bicriteria data compression
- On optimally partitioning a text to improve its compression
- Title not available (Why is that?)
- A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
- Compressing big data: when the rate of convergence to the entropy matters
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
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 Q4633889)
