Next Article in Journal
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
Next Article in Special Issue
A Catalog of Self-Affine Hierarchical Entropy Functions
Previous Article in Journal
Radio-Frequency Interference Detection and Mitigation Algorithms for Synthetic Aperture Radiometers
Open AccessArticle

Lempel–Ziv Data Compression on Parallel and Distributed Systems

Computer Science Department, Sapienza University, Via Salaria 113, Rome, Italy
Algorithms 2011, 4(3), 183-199; https://doi.org/10.3390/a4030183
Received: 29 July 2011 / Revised: 23 August 2011 / Accepted: 30 August 2011 / Published: 14 September 2011
(This article belongs to the Special Issue Data Compression, Communication and Processing)
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. View Full-Text
Keywords: dictionary-based compression; string factorization; parallel complexity; distributed algorithm; binary image dictionary-based compression; string factorization; parallel complexity; distributed algorithm; binary image
MDPI and ACS Style

De Agostino, S. Lempel–Ziv Data Compression on Parallel and Distributed Systems. Algorithms 2011, 4, 183-199.

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop