Lempel-Ziv data compression on parallel and distributed systems
binary imagedictionary-based compressiondistributed algorithmparallel complexitystring factorization
Distributed systems (68M14) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Summary: We present a survey of results concerning Lempel-Ziv data compression on parallel and distributed systems, starting from the theoretical approach to parallel time complexity to conclude with the practical goal of designing distributed algorithms with low communication cost. Storer's extension for image compression is also discussed.
- A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
- A Space-Economical Suffix Tree Construction Algorithm
- A universal algorithm for sequential data compression
- A worst-case analysis of the LZ2 compression algorithm
- BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Compression of individual sequences via variable-rate coding
- Data compression via textual substitution
- Efficient parallel algorithms to test square-freeness and factorize strings
- Generalized Kraft Inequality and Arithmetic Coding
- scientific article; zbMATH DE number 3919857 (Why is no real title available?)
- scientific article; zbMATH DE number 4045113 (Why is no real title available?)
- Jewels of Stringology
- Linear Algorithm for Data Compression via String Matching
- On the Complexity of Finite Sequences
- On-line versus off-line computation in dynamic text compression
- P-complete problems in data compression
- Parallel Lempel Ziv coding
- Parallelism and dictionary based data compression
- Run-length encodings (Corresp.)
- Scalability and communication in parallel low-complexity lossless compression
- Universal modeling and coding
- P-complete problems in data compression
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- Parallel Lempel Ziv coding
- Parallel algorithms for Burrows-Wheeler compression and decompression
- Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
- Sistemas distribuídos aplicados à compressão e recuperação de imagens
- Compression of Three-State Data Serial Streams by Means of a Parallel LFSR Signature Analyzer
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
- scientific article; zbMATH DE number 1786445 (Why is no real title available?)
- The greedy approach to dictionary-based static text compression on a distributed system
- Lempel-Ziv Compression in a Sliding Window
- Parallelism and dictionary based data compression
- Compression using efficient multicasting
- A new algorithm for compression of partially commutative alphabets
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- Compression using efficient multicasting
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)
