Miyake 2006 (Lossy Compression Data Compression): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n*{2}^n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://www.semanticscholar.org/paper/Lossy-Data-Compression-over-Zq-by-LDPC-Code-Miyake/652f0438118898b63126f7261ec4cd2002ff0e0b") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O({2}^n)$ words | |||
() | (Parity check matrix is size poly(n), distortion dictionary is size O(2^n)) | ||
== Description == | == Description == | ||
Low Density Parity Check (LDPC) | |||
== Approximate? == | == Approximate? == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM | |||
== Year == | == Year == | ||
Latest revision as of 09:46, 10 April 2023
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