An efficient pseudocodeword search algorithm for linear programming decoding of LDPC codes

IEEE Transactions on Information Theory

Volumn 54, Issue 4, 2008, Pages 1514-1520

  Chertkov, Michael ^a   Stepanov, Mikhail G ^b  

^a CENTER FOR NONLINEAR STUDIES   (United States)

^b University of Arizona   (United States)

Author keywords

Error floor; Linear programming decoding; Low density parity check (LDPC) codes

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; OPTIMIZATION;

LINEAR PROGRAMMING DECODING; LOW-DENSITY PARITY-CHECK (LDPC) CODES; PSEUDOCODEWORD SEARCH ALGORITHM; PSEUDOCODEWORDS;

DECODING;

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

References (26)

1. J. Feldman, M. Wainwright, and D. R. Karger, "Using linear programming to decode linear codes," in 2003 Conf. Inf. Sci. Syst., The John Hopkins Univ., Baltimore, MD, Mar. 12-14, 2003.
2. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
3. C. E. Shannon, "A mathematical theory of communications," Bell. Syst. Tech. J. 27. 379, vol. 27, no. 623, 1948.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Network of Plausible Inference. San Francisco, CA, Kaufmann, 1988.
6. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, p. 399, 1999.
7. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Symp. Turbo Codes Related Topics, Brest, France, Sept. 1-5, 2003, pp. 75-82.
8. P. O. Vontobel and R. Koetter, "On the relationship between LP decoding and min-sum algorithms decoding," in Proc. ISITA, Parma, Italy, 2004.
9. P. O. Vontobel and R. Koetter, Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes arXiv:cS.IT/ 0512078..
10. J. S. Yedidia, W. T. Freeman, and Y. Weiss, "Constructing free energy approximations and generalized belief propagation algorithms," IEEE Trans. Inf. Theory, vol. 51, p. 2282, 2005.
11. H. A. Bethe, "Statistical theories of superlattices," in Proc. R. Soc. London A, 1935, vol. 150, p. 552.
12. R. Kikuchi, "A theory of cooperative phenomena," Phys. Rev., vol. 81, p. 988, 1951.
13. T. Richardson, "Error floors of LDPC codes," in Proc. 41st Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2003, pp. 1426-1435.
14. M. G. Stepanov, V. Chernyak, M. Chertkov, and B. Vasic, "Diagnosis of weakness in error correction codes: A physics approach to error floor analysis," Phys. Rev. Lett., vol. 95, p. 228701, 2005 [Online]. Available: http://www.arxiv.org/cond-mat/0506037
15. G. D. Forney, R. Koetter Jr., F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Codes, Syst., Graphical Models of IMA Vol. Math. Appl. B. Marcus and J. Rosenthal, Eds., Minneapolis, MN, 1999/2001, vol. 1233, pp. 101-112, Springer-Verlag.
16. N. Wiberg, H.-A. Loeliger, and R. Kotter, "Codes and iterative decoding on general graphs," Europ. Transaction Telecommunications, vol. 6, p. 513, 1995.
17. N. Wiberg, "Codes and decoding on general graphs," Ph.D. thesis, Linköping Univ., Linköping, 1996.
18. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. ISCTA, Ambleside, U.K., 2001.
19. P. O. Vontobel, R. Smarandache, N. Kiyavash, J. Teutsch, and D. Vukobratovic, "On the minimal pseudo-codewords of codes from finite geometries," in ISIT 2005, Adelaide, Australia, Sep. 4-9, 2005, pp. 980-984 [Online]. Available: http://www.arxiv.org/abs/cs.IT/0508019
20. G. A. Margulis, "Explicit construction of graphs without short circles and low-density codes," Combinatorica, vol. 2, p. 71, 1982.
21. D. J. C. MacKay and M. J. Postol, "Weaknesses of margulis and ramanujan-margulis low-density parity-check codes," in Proc. MFCSIT2002, Galway [Online]. Available: http:// www.inference.phy.cam.ac.uk/mackay/abstracts/margulis.html
22. M. G. Stepanov and M. Chertkov, "Instanton analysis of Low-Density-Parity-Check codes in the error-floor regime," in arXiv:cS.IT/0601070, Proc. ISIT 2006, Seattle, Jul. 2006.
23. M. H. N. Taghavi and P. H. Siegel, "Adaptive linear programming decoding," in Proc. IEEE ISIT, Seattle, WA, 2006, arxiv:cS.IT/0601099.
24. P. O. Vontobel and R. Koetter, "Toward low-complexity linear-programming decoding," in Proc. 4th Int. Symp. Turbo Codes and Related Topics, Munich, Germany, Apr. 3-7, 2006, arxiv:cS/0602088.
25. A. G. Dimakis and M. J.Wainwright, "Guessing facets: Polytope structure and improved LP decoder," in Proc. IEEE ISIT, Seattle, WA, 2006 [Snline]. Available: Arxiv:cs/0608029
26. M. Chertkov and V. Chernyak, "Loop calculus helps to improve belief propagation and linear programming decodings of low-density-parity-check codes," in Proc. 44th Allerton Conf., Sep. 2006 [Online]. ASailable: ArXiv:cs.IT/0609154