Miyake 2006 (Lossy Compression Data Compression)
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