Lempel-Ziv data compression on parallel and distributed systems
DOI10.3390/A4030183zbMATH Open1461.68075OpenAlexW2502297787MaRDI QIDQ1736484FDOQ1736484
Authors: Sergio De Agostino 
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a4030183
Recommendations
distributed algorithmparallel complexitydictionary-based compressionbinary imagestring factorization
Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Compression of individual sequences via variable-rate coding
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Jewels of Stringology
- A Space-Economical Suffix Tree Construction Algorithm
- Linear Algorithm for Data Compression via String Matching
- P-complete problems in data compression
- Run-length encodings (Corresp.)
- Title not available (Why is that?)
- Data compression via textual substitution
- Generalized Kraft Inequality and Arithmetic Coding
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Parallelism and dictionary based data compression
- Scalability and communication in parallel low-complexity lossless compression
- A worst-case analysis of the LZ2 compression algorithm
- Title not available (Why is that?)
- Universal modeling and coding
- A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
- On-line versus off-line computation in dynamic text compression
- Efficient parallel algorithms to test square-freeness and factorize strings
- Parallel Lempel Ziv coding
- BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC
Cited In (15)
- Parallel algorithms for Burrows-Wheeler compression and decompression
- The greedy approach to dictionary-based static text compression on a distributed system
- Compression using efficient multicasting
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- Compression using efficient multicasting
- Parallel Lempel Ziv coding
- Compression of Three-State Data Serial Streams by Means of a Parallel LFSR Signature Analyzer
- Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
- Lempel-Ziv Compression in a Sliding Window
- Title not available (Why is that?)
- Parallelism and dictionary based data compression
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
- Sistemas distribuídos aplicados à compressão e recuperação de imagens
- A new algorithm for compression of partially commutative alphabets
This page was built for publication: Lempel-Ziv data compression on parallel and distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736484)
