Martinian and M. J. Wainwright (Lossy Compression Data Compression)
Jump to navigation
Jump to search
Time Complexity
$O(n*{2}^n)$
Space Complexity
$O(mn+mk)$? words
(Consists of an LDGM portion (O(n+m) nodes, O(mn) edges) and an LDPC portion (O(m+k) nodes, O(mk) edges))
Description
LDGM + LDPC
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2006