Lempel–Ziv Data Compression on Parallel and Distributed Systems

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 im...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithms Ročník 4; číslo 3; s. 183 - 199
Hlavní autor: De Agostino, Sergio
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.09.2011
Témata:
binary image
dictionary-based compression
parallel complexity; distributed algorithm
string factorization
ISSN:1999-4893, 1999-4893
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a4030183