Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Elements of information theory
Elements of information theory
Randomized algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximating the Satisfiability Threshold for Random k-XOR-formulas
Combinatorics, Probability and Computing
Low Density Codes Achieve theRate-Distortion Bound
DCC '06 Proceedings of the Data Compression Conference
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Modern Coding Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
A coding theorem for lossy data compression by LDPC codes
IEEE Transactions on Information Theory
Using linear programming to Decode Binary linear codes
IEEE Transactions on Information Theory
Hi-index | 754.84 |
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average distortion achieved by check-regular ensemble of LDGM codes under optimal minimum distance source encoding. These bounds establish that the average distortion using such bounded degree families rapidly approaches the Shannon limit as the degrees are increased. Second, we propose a family of message-passing algorithms, ranging from the standard belief propagation algorithm at one extreme to a variant of survey propagation algorithm at the other. When combined with a decimation subroutine and applied to LDGM codes with suitably irregular degree distributions, we show that such a message-passing/decimation algorithm yields distortion very close to the Shannon rate-distortion bound for the binary symmetric source.