On the bit-complexity of Lempel-Ziv compression
From MaRDI portal
(Redirected from Publication:4633889)
On the bit-complexity of Lempel-Ziv compression (scientific article; zbMATH DE number 7051246)
On the bit-complexity of Lempel-Ziv compression (scientific article; zbMATH DE number 7051246)
Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)
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
Cited in
(24)- A worst-case analysis of the LZ2 compression algorithm
- On optimal parsing for LZ78-like compressors
- Note on the greedy parsing optimality for dictionary-based text compression
- Compressing big data: when the rate of convergence to the entropy matters
- On the bit-complexity of Lempel-Ziv compression
- scientific article; zbMATH DE number 2182423 (Why is no real title available?)
- Relations between greedy and bit-optimal LZ77 encodings
- Compression estimates for a class of dictionary based compressors
- On the Hardness of Finding Optimal Multiple Preset Dictionaries
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- 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
- Dictionary-symbolwise flexible parsing
- Lempel-Ziv: a ``one-bit catastrophe but not a tragedy
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Entropy lower bounds for dictionary compression
- Lempel-Ziv Compression in a Sliding Window
- Bicriteria data compression
- scientific article; zbMATH DE number 975330 (Why is no real title available?)
- Data compression with long repeated strings
- Compression in the presence of shared data
- On optimally partitioning a text to improve its compression
- Genome assembly, from practice to theory: safe, complete and \textit{linear-time}
- Genome assembly, from practice to theory: safe, complete and linear-time
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)
