Miyake 2006 (Lossy Compression Data Compression)

From Algorithm Wiki

Revision as of 08:46, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n*{2}^n)$

Space Complexity

$O({2}^n)$ words

(Parity check matrix is size poly(n), distortion dictionary is size O(2^n))

Description

Low Density Parity Check (LDPC)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2006

Reference

https://www.semanticscholar.org/paper/Lossy-Data-Compression-over-Zq-by-LDPC-Code-Miyake/652f0438118898b63126f7261ec4cd2002ff0e0b

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Miyake_2006_(Lossy_Compression_Data_Compression)&oldid=47461"