Matsunaga; Yamamoto (Lossy Compression Data Compression)

Time Complexity

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

Space Complexity

exp(n) words

(https://doi-org.ezproxy.canberra.edu.au/10.1109/TIT.2003.815805)

Description

Low Density Parity Check (LDPC)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2003

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1109/TIT.2003.815805