Maneva and M. J. Wainwright (Lossy Compression Data Compression)
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == == Year == 2005 == Reference == https://ieeexplore.ieee.org/document/1523592")
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
Year
2005