Griffith-Kelly-Sherman correlation inequalities: A useful tool in the theory of error correcting codes

IEEE Transactions on Information Theory

Volumn 53, Issue 2, 2007, Pages 664-683

  Macris, Nicolas ^a  

^a EPFL   (Switzerland)

Author keywords

Correlation inequalities; Density evolution; Generalized EXIT (GEXIT) curve; Growth rate; Interpolation technique; Iterative decoding; Low density parity check (LDPC) codes; Spin glasses

Indexed keywords

CODES (SYMBOLS); ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); INTERPOLATION; ITERATIVE DECODING;

CORRELATION INEQUALITY; DENSITY EVOLUTION; LOW DENSITY PARITY-CHECK CODES;

CORRELATION THEORY;

EID: 33847630712     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.889002     Document Type: Article

References (36)

1. N. Sourlas, "Spin glass models as error correcting codes," Nature, vol. 339, pp. 693-695, 1989.
2. T. Murayama, Y. Kabashima, D. Saad, and R. Vicente, "Statistical physics of regular low-density parity-check error correcting codes," Phys. Rev. E, vol. 62, pp. 1577-1591, 2000.
3. A. Montanari, "The glassy phase of Gallager codes," European Phys. J., vol. 23, 2001.
4. Y. Kabashima, N. Sazuka, K. Nakamura, and D. Saad, "Evaluating zero error noise threshholds by the replica method for Gallager code ensembles," in Proc. ISIT, Lausanne, Switzerland, Jun. 2002, p. 255.
5. F. Guerra and F. Toninelli, "Quadratic replica coupling in the Sherrington-Kirkpatrick mean field spin glass model," J. Math. Phys, vol. 43, p. 3704, 2002.
6. F. Guerra, "Broken replica symmetry bounds in the mean field spin glass model," Commun. Math. Phys., vol. 233, pp. 1-12, 2003.
7. M. Talagrand, "The Parisi formula," Ann. Math., vol. 163, pp. 221-263, 2005.
8. S. Franz and M. Leone, "Replica bounds for optimization problems and diluted spin systems," J. Stat. Phys., vol. 111, pp. 535-564, 2003.
9. M. Talagrand and D. Panchenko, "Bounds for diluted mean-fields spin glass models," Prob. Theory Rel. Fields, vol. 130, pp. 319-336, 2004.
10. A. Montanari, "Tight bounds for LDPC and LDGM codes under MAP decoding," IEEE Trans. Inf. Theory, vol. 51, pp. 3221-3246, 2005.
11. C. Measson, A. Montanari, T. Richardson, and R. Urbanke, The Generalized Area Theorem and Some of its Consequences 2005 [Online]. Available: ArXiv, cs.IT/0511039, to be published
12. N. Macris, "On the relation between MAP and BP GEXIT functions of low density parity check codes," in Proc. IEEE Inf. Theory Workshop, Punta del Este, Uruguay, Mar. 13-17, 2006.
13. N. Macris, Sharp Bounds on Generalized EXIT Functions, 2005, to be published.
14. V. Rathi, "On the asymptotic weight and stopping set distribution of regular LDPC ensembles," IEEE Trans. Inf. Theory, vol. 52, pp. 4212-4218, 2006.
15. R. B. Griffiths, Phase Transitions and Critical Phenomena, C. Domb and M. S. Green, Eds. New York: Academic, 1972, vol. 1.
16. S. Morita, H. Nishimori, and P. Contucci, "Griffiths inequalities for the Gaussian spin glass," J. Phys. A, vol. 37, p. L203, 2004.
17. N. Macris, "Correlation inequalities: A useful tool in the theory of LDPC codes," in Proc. Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 4-9, 2005, pp. 2369-2373.
18. H. Nishimori, Progr. Theor. Phys., vol. 66, pp. 1169-1169, 1981.
19. H. Nishimori, Statistical Physics of Spin Glasses and Information Processing: An Introduction. Oxford, U.K.: Oxford Science, 2001.
20. C. Measson and R. Urbanke, "An upper-bound for the ML threshold of iterative coding systems over the BEC," in Proc. 41st Allerton Conf Commun, Contr. Comput., Monticello, NY, Oct. 2003, p. 3.
21. C. Measson, A. Montanari, T. Richardson, and R. Urbanke, "Life above threshold: From list decoding to area theorem and MSE," in IEEE Inf. Theory Workshop, San Antonio, TX, Oct. 2004.
22. R. Urbanke and T. Richardson, Modern Coding Theory, to be published.
23. A. Ashikhmin, G. Kramer, and S. ten Brink, "Code rate and the area under extrinsic information transfer curves," in Proc. ISIT, Lausanne, Switzerland, Jun. 2002.
24. D. Guo, S. Shamai, and S. Verdu, "Mutual information and MMSE in Gaussian channels," in Proc. 2004 ISIT, Chicago, IL, p. 347.
25. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, pp. 533-547, 1981.
26. F. Kschischang, B. Frey, and H. A. Loeliger, "Factor graphs and the sum product algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, 2001.
27. R. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
28. S. Listyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inf. Theory, vol. 48, pp. 887-908, 2002.
29. C. Di, "Asymptotic and Finite Length Analysis of Low-Density Parity-Check Codes," Thesis No 3072, Ecole Polytechnique Federate Lausanne, Lausanne, Switzerland, 2004.
30. C. Di, A. Montanari, and R. Urbanke, "Weight distribution of LDPC codes: Combinatorics meets statistical physics," in Proc. 2004 ISIT, Chicago, IL.
31. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message passing decoding," IEEE Trans. Inf. Theory, vol. 47, pp. 638-656, 2001.
32. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, pp. 619-637, 2001.
33. L. D. Landau and I. M. Lifshitz, Statistical Physics. Reading, MA: Addison Wesley, 1969.
34. P. M. Chaikin and T. C. Lubensky, Principles of Condensed Matter Physics. Cambridge, U.K.: Cambridge University Press, 2000, ch. 8.
35. R. Baxter, Exactly Solved Models in Statistical Mechanics. New York: Academic, ch. 3.
36. S. Franz, M. Leone, and F. Toninelli, "Replica bounds for diluted non-Poissonian spin systems," J. Phys. A, vol. 36, pp. 10,967-10,985, 2003.