Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 229-233

  Smarandache, Roxana ^a   Vontobel, Pascal O ^b  

^a SAN DIEGO STATE UNIVERSITY   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Absdet pseudo codeword; Fundamental cone; Low density parity check code; Message passing iterative decoding; Perm pseudo codeword; Pseudo codeword; Tanner graph

Indexed keywords

ABSDET-PSEUDO-CODEWORD; FUNDAMENTAL CONE; LOW-DENSITY PARITY-CHECK CODE; MESSAGE-PASSING ITERATIVE DECODING; PERM-PSEUDO-CODEWORD; PSEUDO-CODEWORD; TANNER GRAPH;

BINARY CODES; BLOCK CODES; CHANNEL CODING; CODING ERRORS; INFORMATION THEORY; MESSAGE PASSING; SIGNAL ENCODING;

ITERATIVE DECODING;

EID: 70449460933     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205910     Document Type: Conference Paper

References (14)

1. D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems, and Graphical Models (Minneapolis, MN, 1999), B. Marcus and J. Rosenthal, Eds. Springer Verlag, New York, Inc., 2001, pp. 113-130.
2. R. Smarandache and P. O. Vontobel, "On regular quasi-cyclic LDPC codes from binomials," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, USA, June 27-July 2 2004, p. 274.
3. -, "Quasi-cyclic LDPC codes: influence of proto- and Tannergraph structure on minimum Hamming distance upper bounds," submitted to IEEE Trans. Inf. Theory, available online under http://arxiv.org/abs/0901.4129, Jan. 2009.
4. J. Feldman, "Decoding error-correcting codes via linear programming,"Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA,2003.
5. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 954-972, Mar. 2005.
6. R. Koetter and P. o. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Intern. Symp. on Turbo Codes and Related Topics, Brest, France, Sept. 1-5 2003, pp. 75-82.
7. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finitelength analysis of message-passing iterative decoding of LDPC codes," accepted for IEEE Trans. Inform. Theory, available online under http://www.arxiv.org/abs/cs.IT/0512078.2007.
8. R. Koetter, W.-C. W. Li, P. O. Vontobel, and J. L. Walker, "Characterizations of pseudo-codewords of (low-density) parity-check codes," Adv. in Math., vol. 213, no. 1, pp. 205-229, Aug. 2007.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory, ser. Wiley Series in Telecommunications. New York: John Wiley & Sons Inc., 1991, a Wiley-Interscience Publication.
10. J. B. Dennis, Mathematical Programming and Electrical Networks. The Technology Press of The Massachusetts Institute of Technology, Cambridge, MA, 1959.
11. P.O. Vontobel, Kalman Filters, Factor Graphs, and Electrical Networks. Post-Diploma Project, ETH Zurich, 2002.
12. -, "Factor graphs, electrical networks, and entropy," in Proc. 40th Allerton Conf. on Communication, Control, and Computing, Allerton House, Monticello, Illinois, USA, Oct. 2-4 2002.
13. M. Chertkov, V. Y. Chemyak, and R. Teodorescu, "Belief propagation and loop series on planar graphs," J Stat. Mech.: Theory and Experiment, P05003, 2008.
14. M. Chertkov and M. G. Stepanov, "An efficient pseudocodeword search algorithm for linear programming decoding of LDPC codes," IEEE Trans. Inf. Theory, vol. 54, no. 4, pp. 1514-1520, Apr. 2008.