Lempel-Ziv data compression on parallel and distributed systems
From MaRDI portal
(Redirected from Publication:1736484)
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 3919857 (Why is no real title available?)
- scientific article; zbMATH DE number 4045113 (Why is no real title available?)
- 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
- 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
Cited in
(15)- Parallel algorithms for Burrows-Wheeler compression and decompression
- The greedy approach to dictionary-based static text compression on a distributed system
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- Parallelism and dictionary based data compression
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- 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?)
- Sistemas distribuídos aplicados à compressão e recuperação de imagens
- Compression using efficient multicasting
- Lempel-Ziv Compression in a Sliding Window
- Compression using efficient multicasting
- 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
- Parallel Lempel Ziv coding
- 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)
