The greedy approach to dictionary-based static text compression on a distributed system
From MaRDI portal
Publication:491153
DOI10.1016/J.JDA.2015.05.001zbMath1336.68271OpenAlexW386772770MaRDI QIDQ491153
Publication date: 24 August 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2015.05.001
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed algorithms (68W15) Computing methodologies for text processing; mathematical typography (68U15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Dictionary-symbolwise flexible parsing
- Scalability and communication in parallel low-complexity lossless compression
- On optimally partitioning a text to improve its compression
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Note on the greedy parsing optimality for dictionary-based text compression
- On the Bit-Complexity of Lempel--Ziv Compression
- Bicriteria Data Compression: Efficient and Usable
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Jewels of Stringology
- Parallelism and dictionary based data compression
This page was built for publication: The greedy approach to dictionary-based static text compression on a distributed system