Algorithms 2011, 4(3), 183-199; doi:10.3390/a4030183
Article

Lempel–Ziv Data Compression on Parallel and Distributed Systems

email
Received: 29 July 2011; in revised form: 23 August 2011 / Accepted: 30 August 2011 / Published: 14 September 2011
(This article belongs to the Special Issue Data Compression, Communication and Processing)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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.
Keywords: dictionary-based compression; string factorization; parallel complexity; distributed algorithm; binary image
PDF Full-text Download PDF Full-Text [167 KB, uploaded 14 September 2011 09:00 CEST]

Export to BibTeX |
EndNote


MDPI and ACS Style

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

AMA Style

De Agostino S. Lempel–Ziv Data Compression on Parallel and Distributed Systems. Algorithms. 2011; 4(3):183-199.

Chicago/Turabian Style

De Agostino, Sergio. 2011. "Lempel–Ziv Data Compression on Parallel and Distributed Systems." Algorithms 4, no. 3: 183-199.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert