The benefit of thresholding in LP decoding of LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 307-311

  Feldman, Jon ^a   Koetter, Ralf ^b   Vontobel, Pascal O ^c  

^a Columbia University ^*  (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSMISSION; LOG-LIKELIHOOD RATIOS; LOW-DENSITY PARITY-CHECK CODES;

DECODING; GAUSSIAN NOISE (ELECTRONIC); INFORMATION THEORY; LINEAR PROGRAMMING; SIGNAL TO NOISE RATIO;

CODES (SYMBOLS);

EID: 33749424945     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523344     Document Type: Conference Paper

References (15)

1. R. Koetter and P. O. Vontobel, 'Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Intern. Conf. on Turbo Codes and Related Topics, (Brest, France), pp. 75-82, Sept. 1-5 2003. Available online under http: //www.ece.wisc.edu/~vontobel.
2. P. O. Vontobel and R. Koetter, 'On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. Intern. Symp. on Inform. Theory and its Applications (ISITA), (Parma, Italy), pp. 991-996, 2004.
3. J. Feldman, Decoding Error-Correcting Codes via Linear Programming. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 2003. Available online under http: //www.columbia.edu/~jf2189/pubs.html.
4. J. Feldman, M. J. Wainwright, and D. R. Karger, 'Using linear programming to decode binary linear codes," IEEE Trans. on Inform. Theory, vol. IT-51, no. 3, pp. 954-972, 2005.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley Series in Telecommunications, New York: John Wiley & Sons Inc., 1991. A Wiley-Interscience Publication.
6. J. Feldman, T. Malkin, C. Stein, R. A. Servedio, and M. J. Wainwright, 'LP decoding corrects a constant fraction of errors," in Proc. IEEE Intern. Symp. on Inform. Theory, (Chicago, IL, USA), p. 68, June 27-July 2 2004.
7. A. Ganti, A. Lapidoth, and İ. E. Telatar, 'Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit," IEEE Trans. on Inform. Theory, vol. IT-46, no. 7, pp. 2315-2328, 2000.
8. R. Koetter, W.-C. W. Li, P. O. Vontobel, and J. L. Walker, 'Pseudocodewords of cycle codes via zeta functions," in Proc. IEEE Inform. Theory Workshop, (San Antonio, TX, USA), pp. 7-12, Oct. 24-29 2004.
9. P. O. Vontobel and R. Koetter, 'Lower bounds on the minimum pseudoweight of linear codes," in Proc. IEEE Intern. Symp. on Inform. Theory, (Chicago, IL, USA), p. 70, June 27-July 2 2004.
10. J. Feldman and C. Stein, 'LP decoding achieves capacity," in Symposium on Discrete Algorithms (SODA '05), (Vancouver, Canada), Jan. 23-25 2005.
11. 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.
12. R. M. Tanner, 'A recursive approach to low-complexity codes," IEEE Trans. on Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
13. M. Lentmaier, D. V. Truhachev, D. J. Costello, Jr., and K. Zigangirov, 'On the block error probability of iteratively decoded LDPC codes," in 5th ITG Conference on Source and Channel Coding, (Erlangen, Germany), Jan. 14-16 2004.
14. D. Burshtein and G. Miller, 'Expander graph arguments for message-passing algorithms," IEEE Trans. on Inform. Theory, vol. IT-47, pp. 782-790, Feb. 2001.
15. D. Spielman, Computationally Effi dent Error-Correcting Codes and Holographic Proofs. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 1995.