Skip to main content
Log in

Applications of correlation inequalities to low density graphical codes

  • Hamiltonian Systems
  • Published:
The European Physical Journal B - Condensed Matter and Complex Systems Aims and scope Submit manuscript

Abstract.

This contribution is based on the contents of a talk delivered at the Next-SigmaPhi conference held in Crete in August 2005. It is adressed to an audience of physicists with diverse horizons and does not assume any background in communications theory. Capacity approaching error correcting codes for channel communication known as Low Density Parity Check (LDPC) codes have attracted considerable attention from coding theorists in the last decade. Surprisingly strong connections with the theory of diluted spin glasses have been discovered. In this work we elucidate one new connection, namely that a class of correlation inequalities valid for Gaussian spin glasses can be applied to the theoretical analysis of LDPC codes. This allows for a rigorous comparison between the so called (optimal) maximum a posteriori and the computationaly efficient belief propagation decoders. The main ideas of the proofs are explained and we refer to recent works for the more lengthy technical details.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • R.B. Ash, Information Theory (Dover Publications, 1990)

  • N. Sourlas, Nature 339, 693 (1989); in From Statistical Physics to Statistical inference and back, edited by. P. Grassberger, J.P. Nadal (Kluwer Academic, 1994), p. 195; in Mathematical Results in Statistical Mechanics, edited by S. Miracle-Sole, J. Ruiz, V. Zagrebnov (World Scientific, 1999), p. 475

    Article  ADS  Google Scholar 

  • A. Montanari, Eur. Phys. J. 23 (2001)

  • H. Nishimori, Statistical Physics of Spin Glasses and Information Processing: An Introduction (Oxford Science Publications, 2001)

  • R. Urbanke, T. Richardson, in Modern Coding Theory (Cambridge University Press, in preparation)

  • F. Guerra, F. Toninelli, J. Math. Phys. 43, 3704 (2002)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  • A. Montanari, Tight bounds for LDPC and LDGM codes under MAP decoding, preprint (2004)

  • S. Morita, H. Nishimori, P. Contucci, J. Phys. A 37, L203 (2004)

  • C. Méasson, R. Urbanke, An upper-bound for the ML threshold of iterative coding systems over the BEC, Proc. of the 41st Allerton Conference on Communications, Control and Computing, Allerton House, Monticello, USA, October 2003, p. 3

  • N. Macris, Correlation inequalities: a useful tool in the theory of LDPC codes, Proc. IEEE int symp inf theory, Adelaide, September (2005)

  • N. Macris, Griffith-Kelly-Sherman correlation inequalities: a useful tool in the theory of error correcting codes, preprint (2005)

  • N. Macris, Sharp bounds on generalized EXIT functions, preprint (2005)

  • C. Méasson, A. Montanari,and R.Urbanke, Proc of IEEE Int. Symp Inf. Theory, Adelaide, Australia (2005)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N. Macris.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Macris, N. Applications of correlation inequalities to low density graphical codes. Eur. Phys. J. B 50, 51–55 (2006). https://doi.org/10.1140/epjb/e2006-00129-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1140/epjb/e2006-00129-6

PACS.

Navigation