Maneva and M. J. Wainwright (Lossy Compression Data Compression)

From Algorithm Wiki

Revision as of 08:46, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ bits

(Derived: size of the factor graph representation of the generator matrix, or size of the generator matrix itself)

Description

Low Density Generator Matrix (LDGM) codes; for a Bernouli(1/2) source

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2005

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/1523592

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Maneva_and_M._J._Wainwright_(Lossy_Compression_Data_Compression)&oldid=47457"