Pseudo-codeword landscape

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 1546-1550

  Chertkov, Michael ^a   Siepanov, Mikhail ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE WORDS; INTERNATIONAL SYMPOSIUM;

ACOUSTIC INTENSITY; CYBERNETICS; DECODING; ERROR ANALYSIS; FLOORS; INFORMATION THEORY; LINEAR PROGRAMMING; LINEARIZATION; TECHNICAL PRESENTATIONS;

CODES (SYMBOLS);

EID: 51649124277     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557442     Document Type: Conference Paper

References (25)

1. R.G. Gallager, Low density parity check codes (MIT Press Cambride. MA, 1963).
2. C. Berrou, A. Glavieux. P. Thitimajshima, Near Shannon Limit error-correcting coding and decoding: Turbo codes, Proceedings IEEE In ternational Conference on Communications, 23-26 May 1993, Geneva, Switzerland; p.1064-70 vol.2
3. D.J.C. MacKay, Good error-correcting codes bated on very sparse matrices, IEEE Trans. Inf. Theory 45 (2) 399-431 (1999).
4. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27. pt. I, pp. 379-423. 1948; pt. II. pp. 623-656, 1948.
5. IEEE P802.11n/D1.05 October 2006, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications - Enhancements for Higher Throughput (Draft).
6. K. M. Kurtas and B. Vasic (editors), Advanced Error Control Techniques for Data Storage Systems, New York: CRC Press, 2005.
7. J. Feldman. M. Wainwright, D.R. Karger, Using linear programming to decode binary linear codes, IEEE IT51, 954 (2005).
8. J.S. Yedidia, W.T. Freeman, Y. Weiss, Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms, IEEE IT51 2282 (2005).
9. R. Koetter. P.O. Vontobel, Graph covers and iterative decoding of finite-length codes, Proc. 3rd International Symposium on Turbo Codes & Related Topics, Brest, France, p. 75-82, Sept. 1-5. 2003.
10. P.O. Vontobel, and R. Koetter, On the relationship between LP decoding and Min-Sum Algorithms Decoding, ISITA 2004, Parma Italy.
11. P.O. Vontobel, R. Koetter. Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes, arXiv:cs.IT/0512078.
12. M. Chertkov. M. Stepanov, An Efficient Pseudo-Codeword-Search Algorithm for Linear Programming Decoding of LDPC Codes, arXiv:cs.IT/0601113, submitted to IEEE Transactions on Information Theory.
13. M. Chertkov, V. Chernyak. Loop Calculus Helps to Improve Belief Propagation and Linear Programming Decodings of Low-Density-Parity-Check Codes, invited talk at 44th Allerton Conference (September 27-29, 2006, Allerton.IL), arXiv:cs.IT/0609154.
14. M.H. Taghavi N., P.H. Siegel, Adaptive Linear Programming Decoding, Proceedings of the IEEE ISIT, Seattle 2006. arxiv:cs.IT/0601099.
15. P.O. Vontobel and R. Koetter. Towards Low-Complexity Linear-Programming Decoding, Proc. 4th Int. Symposium on Turbo Codes and Related Topics, Munich, Germany, April 3-7. 2006. arxiv:cs/0602088.
16. M. Yannakakis. Expressing combinatorial optimization problems by linear programs, J. of Computer and System Sciences, 43(3) 441-466 (1991).
17. M.G. Stepanov. V. Chernyak, M. Chertkov. B. Vasic, Diagnosis of weakness in error correction codes: a physics approach to error floor analysis, Phys. Rev. Lett. 95, 228701 (2005) [See also http://www.arxiv.org/cond-mat/0506037 for extended version with Supplements.]
18. N. Wiberg Codes and decoding on general graphs, Ph.D. thesis. Linköping University, 1996.
19. T. Richardson, Error floors of LDPC codes, 2003 Allerton conference Proceedings.
20. G.D. Forney, Jr., R. Koetter, F.R. Kschischang, and A. Reznik, On the effective weights of pseudocodewords for codes defined on graphs with cycles, in Codes. Systems, and Graphical Models (Minneapolis, MN, 1999)(B, Marcus and J. Rosenthal, eds.) vol. 123 of IMA Vol. Math. Appl.., pp. 101-112 Springer Verlag. New York, Inc., 2001.
21. N. Wiberg, H-A. Loeliger, R. Kotter, Codes and iterative decoding on general graphs, Europ. Transaction Telecommunications 6, 513 (1995).
22. R.M. Tanner, D. Sridhara, T. Fuja, A class of group-structured LDPC codes, Proc. of ISCTA 2001, Ambleside. England.
23. G.A. Margulis, Explicit construction of graphs without short circles and low-density codes, Combinatorica 2, 71 (1982).
24. D.J.C MacKay and M.S. Poslol, Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check codes, Proceedings of MFCSIT2002. Galway, http://www.inference.phy.cam.ac.uk/mackay/abstracts/ maigulis.hlml.
25. M.G. Stepanov, M. Chertkov, Instanton analysis of Low-Density-Parity- Check coties in the error-floor regime, arXiv:cs. IT/0601070. Proceeding of ISIT 2006, July 2006 Seallle.