Reducing the error floor

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 230-235

  Chertkov, Michael ^a  

^a CENTER FOR NONLINEAR STUDIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(E ,2E) THEORY; CODEWORD SEARCH; ERROR FLOOR; GRAPH BASED;

CODES (STANDARDS); CODES (SYMBOLS); CYBERNETICS; FLOORS; INFORMATION THEORY; LEARNING ALGORITHMS; LINEAR PROGRAMMING; LINEARIZATION; MODAL ANALYSIS;

DECODING;

EID: 46749093418     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313079     Document Type: Conference Paper

References (25)

1. R.G. Gallager, Low density parity check codes (MIT PressCambridhe, MA, 1963).
2. N. Wiberg, H-A. Loeliger, R. Kottr, Codes and iterative decoding on general graphs, Europ. Transaction Telecommunications 6, 513 (1995).
3. D.J.C. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inf. Theory 45 (2) 399-431 (1999).
4. T. Richardson, R. Urbanke, The renaissance of Gallager's low-density parity-check codes, IEEE Communications Magazine, vol.41, no. 8, p. 126-31 (2003).
5. C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon Limit error-correcting coding and decoding: Turbo codes, Proceedings IEEE International Conference on Communications, 23-26 May 1993, Geneva, Switzerland; p.1064-70 vol.2
6. J. Feldman, M. Wainwright, D.R. Karger, Using linear programming to decode binary linear codes, 2003 Conference on Information Sciences and Systems, IEEE IT51, 954 (2005).
7. T. Richardson, Error floors of LDPC codes, 2003 Allerton conference Proceedings.
8. 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. 1233 of IMA Vol. Math. Appl.., pp. 101-112 Springer Verlag, New York, Inc., 2001.
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, R. Koetter, Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes, arXiv:cs.IT/0512078.
11. http://www.hpl.hp.com/personal/Pascal_Vontobel/pseudocodewords and references therein.
12. 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); cond-mat/0506037
13. A.G. Dimakis, M.J. Wainwright, Guessing Facets: Polytope Structure and Improved LP Decoder, Proceedings of the IEEE ISIT, Seattle 2006, p. 1369, cs/0608029.
14. 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.
15. M. J. Wainwright and M. I. Jordan, Graphical models, exponential families, and variational inference, No. 649/2003 UC Berkeley, Department of Statistics; http://www.eecs.berkeley.edu/wainwrig/Papers/WaiJorVariational03. pdf
16. P.O. Vontobel, and R. Koetter, On the relationship between LP decoding and Min-Sum Algorithms Decoding, ISITA 2004, Parma Italy.
17. J.S. Yedidia, W.T. Freeman, Y. Weiss, Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms, http://www.merl.com/reports/TR2004-40 & IEEE IT51, 2282 (2005).
18. M. Chertkov, M. Stepanov, An Efficient Pseudo-Codeword-Search Algorithm for Linear Programming Decoding of LDPC Codes, arXiv:cs.IT/0601113, to appear in IEEE IT 2007. Theory.
19. M. Chertkov, M. Stepanov, Pseudo-codeword Landscape, ISIT 2007, June 2007, Nice, cs.IT/0701084 .
20. M. Chertkov, V.Y. Chernyak, Loop Calculus in Statistical Physics and Information Science, Phys. Rev. E 73, 065102(R) (2006); condmat/0601487.
21. M. Chertkov, V. Chernyak, Loop series for discrete statistical models on graphs, J. Stat. Mech. (2006) P06009, cond-mat/0603189.
22. R.M. Tanner, D. Sridhara, T. Fuja, A class of group-structured LDPC codes, Proc. of ISCTA 2001, Ambleside, England.
23. M. Stepanov, M. Chertkov, Improving convergence of belief propagation decoding, cs.IT/0607112, Proceedings of 44th Allerton Conference (September 27-29, 2006, Allerton, IL).
24. M. Stepanov, M. Chertkov, The error-floor of LDPC codes in the Laplacian channel, Proceedings of 43rd Allerton Conference (September 28-30, 2005, Allerton, IL), arXiv:cs.IT/0507031. Stepanov.
25. A. Amraoui, A. Montanari and R. Urbanke, How to find Good Finite-Length Codes: From art Towards Science, in Proc. of 4-th International Symposium on Turbo codes and related topics, Munich 3-7 Apr 2006; cs.IT/0607064.