On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case

DOI10.1016/J.JDA.2013.04.001MaRDI QIDQ396650zbMATH OpenOpenAlexFDO

Authors Alessio Langiu

Publication date 13 August 2014

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2013.04.001

zbMATH Keywords

data compressiondeflate algorithmdictionary-based text compressionLZ77 algorithmparsing optimality

Mathematics Subject Classification ID

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

Recommendations

• Note on the greedy parsing optimality for dictionary-based text compression
• scientific article; zbMATH DE number 1305530
• On optimal parsing for LZ78-like compressors
• The effect of flexible parsing for dynamic dictionary-based data compression
• Quasi-distinct parsing and optimal compression methods
• Quasi-distinct Parsing and Optimal Compression Methods
• The relationship between greedy parsing and symbolwise text compression
• scientific article; zbMATH DE number 1136072
• scientific article; zbMATH DE number 2087040
• The greedy approach to dictionary-based static text compression on a distributed system

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A universal algorithm for sequential data compression
• Algorithms on Strings
• Algorithms on Strings, Trees and Sequences
• Compression of individual sequences via variable-rate coding
• Computing longest previous factor in linear time and applications
• Data compression via textual substitution
• Data compression. The complete reference.
• Dictionary-symbolwise flexible parsing
• Dictionary-symbolwise flexible parsing
• Efficient algorithms for three variants of the LPF table
• scientific article; zbMATH DE number 3919857 (Why is no real title available?)
• scientific article; zbMATH DE number 3468267 (Why is no real title available?)
• scientific article; zbMATH DE number 1305530 (Why is no real title available?)
• Lempel-Ziv factorization using less time \& space
• LPF computation revisited
• On the bit-complexity of Lempel-Ziv compression
• On the Complexity of Finite Sequences
• Quasi-distinct parsing and optimal compression methods
• Replacing suffix trees with enhanced suffix arrays

Cited in

(11)

• On optimal parsing for LZ78-like compressors
• Note on the greedy parsing optimality for dictionary-based text compression
• On the bit-complexity of Lempel-Ziv compression
• Compression estimates for a class of dictionary based compressors
• scientific article; zbMATH DE number 1305530 (Why is no real title available?)
• The relationship between greedy parsing and symbolwise text compression
• On the bit-complexity of Lempel-Ziv compression
• The greedy approach to dictionary-based static text compression on a distributed system
• Binary block order Rouen transform
• The effect of flexible parsing for dynamic dictionary-based data compression
• Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing

This page was built for publication: On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case

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