Maneva and M. J. Wainwright (Lossy Compression Data Compression)
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