M ar 2 00 0 The Statistical Physics of Regular Low-Density Parity-Check Error-Correcting Codes

A variation of Gallager error-correcting codes is investigated using statistical mechanics. In codes of this type, a given message is encoded into a codeword which comprises Boolean sums of message bits selected by two randomly constructed sparse matrices. The similarity of these codes to Ising spin systems with random interaction makes it possible to assess their typical performance by analytical methods developed in the study of disordered systems. The typical case solutions obtained via the replica method are consistent with those obtained in simulations using belief propagation (BP) decoding. We discuss the practical implications of the results obtained and suggest a computationally efficient construction for one of the more practical configurations. Typeset using REVTEX 1

[1]  Michael I. Jordan,et al.  Advances in Neural Information Processing Systems 30 , 1995 .

[2]  Brendan J. Frey,et al.  Graphical Models for Machine Learning and Digital Communication , 1998 .

[3]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[4]  T. Richardson,et al.  Design of provably good low-density parity check codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).