Scalability and communication in parallel low-complexity lossless compression
DOI10.1007/S11786-010-0034-5zbMATH Open1205.94025OpenAlexW2087658922MaRDI QIDQ626896FDOQ626896
Authors: L. Cinque, Sergio De Agostino, L. Lombardi 
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-010-0034-5
Recommendations
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Approximation algorithms (68W25) Distributed algorithms (68W15) Algorithms on strings (68W32)
Cites Work
- Title not available (Why is that?)
- Compression of individual sequences via variable-rate coding
- A universal algorithm for sequential data compression
- Jewels of Stringology
- A Space-Economical Suffix Tree Construction Algorithm
- An Efficient Parallel Biconnectivity Algorithm
- Fast gapped variants for Lempel-Ziv-Welch compression
- Linear Algorithm for Data Compression via String Matching
- P-complete problems in data compression
- Run-length encodings (Corresp.)
- The Parallel Evaluation of General Arithmetic Expressions
- Title not available (Why is that?)
- Generalized Kraft Inequality and Arithmetic Coding
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Parallelism and dictionary based data compression
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- 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
Cited In (9)
- The greedy approach to dictionary-based static text compression on a distributed system
- Title not available (Why is that?)
- Context-based compression of binary images in parallel
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
- Lempel-Ziv data compression on parallel and distributed systems
- Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
- Parallelism and dictionary based data compression
- Adaptive vector quantization for lossy compression of image sequences
- Title not available (Why is that?)
This page was built for publication: Scalability and communication in parallel low-complexity lossless compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626896)
