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

DOI10.1016/J.JDA.2013.04.001zbMath1334.68060OpenAlexW2062006350MaRDI QIDQ396650

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)

Related Items (5)

On optimal parsing for LZ78-like compressors ⋮ Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing ⋮ Note on the greedy parsing optimality for dictionary-based text compression ⋮ The greedy approach to dictionary-based static text compression on a distributed system ⋮ Binary block order Rouen transform

Cites Work

• Efficient algorithms for three variants of the LPF table
• Quasi-distinct parsing and optimal compression methods
• Dictionary-symbolwise flexible parsing
• Replacing suffix trees with enhanced suffix arrays
• Lempel-Ziv factorization using less time \& space
• Computing longest previous factor in linear time and applications
• Dictionary-Symbolwise Flexible Parsing
• LPF Computation Revisited
• Data compression via textual substitution
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Algorithms on Strings, Trees and Sequences
• Algorithms on Strings
• A Method for the Construction of Minimum-Redundancy Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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