Matsunaga; Yamamoto (Lossy Compression Data Compression)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://doi.org/10.1109/TIT.2003.815805")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Reference

https://doi.org/10.1109/TIT.2003.815805

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Matsunaga;_Yamamoto_(Lossy_Compression_Data_Compression)&oldid=44894"