Lempel-Ziv data compression on parallel and distributed systems (Q1736484)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lempel-Ziv data compression on parallel and distributed systems |
scientific article; zbMATH DE number 7042104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lempel-Ziv data compression on parallel and distributed systems |
scientific article; zbMATH DE number 7042104 |
Statements
Lempel-Ziv data compression on parallel and distributed systems (English)
0 references
26 March 2019
0 references
Summary: 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.
0 references
dictionary-based compression
0 references
string factorization
0 references
parallel complexity
0 references
distributed algorithm
0 references
binary image
0 references
0.843035876750946
0 references
0.8045092225074768
0 references
0.7780677676200867
0 references
0.774920642375946
0 references
