Matsunaga; Yamamoto (Lossy Compression Data Compression)
Jump to navigation
Jump to search
Time Complexity
$O(n*{2}^n)$
Space Complexity
exp(n) words
(https://doi.org/10.1109/TIT.2003.815805)
Description
Low Density Parity Check (LDPC)
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2003