Lempel-Ziv data compression on parallel and distributed systems
DOI10.3390/A4030183zbMath1461.68075OpenAlexW2502297787MaRDI QIDQ1736484
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a4030183
parallel complexitydistributed algorithmbinary imagedictionary-based compressionstring factorization
Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Scalability and communication in parallel low-complexity lossless compression
- On-line versus off-line computation in dynamic text compression
- Efficient parallel algorithms to test square-freeness and factorize strings
- P-complete problems in data compression
- A worst-case analysis of the LZ2 compression algorithm
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Parallel Lempel Ziv coding
- BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC
- Universal modeling and coding
- Linear Algorithm for Data Compression via String Matching
- Data compression via textual substitution
- A Space-Economical Suffix Tree Construction Algorithm
- On the Complexity of Finite Sequences
- Generalized Kraft Inequality and Arithmetic Coding
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Jewels of Stringology
- Run-length encodings (Corresp.)
- A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
- Parallelism and dictionary based data compression
This page was built for publication: Lempel-Ziv data compression on parallel and distributed systems