Pseudo-codewords in LDPC convolutional codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1364-1368

  Smarandache, Roxana ^a,b   Pusane, Ali Emre ^b   Vontobel, Pascal O ^c   Costello Jr , Daniel J ^b  

^a SAN DIEGO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF NOTRE DAME   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE MESSAGE-PASSING DECODERS; LDPC CONVOLUTIONAL CODES; LOW-DENSITY PARITY-CHECK (LDPC); PSEUDO-CODEWORDS;

BLOCK CODES; ITERATIVE DECODING; MAXIMUM LIKELIHOOD; MESSAGE PASSING; PROBLEM SOLVING; SIGNAL TO NOISE RATIO;

CONVOLUTIONAL CODES;

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

References (21)

1. R. M. Tanner, "Convolutional codes from quasi-cyclic codes: a link between the theories of block and convolutional codes," University of California, Santa Cruz, Tech Report UCSC-CRL-87-21, Nov. 1987.
2. Y. Levy and D. J. Costello, Jr., "An algebraic approach to constructing convolutional codes from quasi-cyclic codes," in Coding and Quantization (Piscataway, NJ, 1992), vol. 14 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pp. 189-198, Providence, RI: Amer. Math. Soc., 1993.
3. M. Esmaeili, T. A. Gulliver, N. P. Secord, and S. A. Mahmoud, "A link between quasi-cyclic codes and convolutional codes," IEEE Trans. on Inform. Theory, vol. IT-44, no. 1, pp. 431-435, 1998.
4. A. Sridharan, D. J. Costello, Jr., D. Sridhara, T. E. Fuja, and R. M. Tanner, "A construction for low density parity check convolutional codes based on quasi-cyclic block codes," in Proc. IEEE Intern. Symp. on Inform. Theory, (Lausanne, Switzerland), p. 481, June 30-July 5 2002.
5. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. on Inform. Theory, vol. IT-50, pp. 2966-2984, Dec. 2004.
6. A. Sridharan and D. J. Costello, Jr., "A new construction for low density parity check convolutional codes," in Proc. IEEE Inform. Theory Workshop, (Bangalore, India), p. 212, Oct. 20-25 2002.
7. R. Smarandache and P. O. Vontobel, "On regular quasi-cyclic LDPC codes from binomials," in Proc. IEEE Intern. Symp. on Inform. Theory, (Chicago, IL, USA), p. 274, June 27-July 2 2004.
8. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of fi nite-length codes," in Proc. 3rd Intern. Symp. on Turbo Codes and Related Topics, (Brest, France), pp. 75-82, Sept. 1-5 2003.
9. P. O. Vontobel and R. Koetter, "Graph-cover decoding and fi nite-length analysis of message-passing iterative decoding of LDPC codes," submitted to IEEE Trans. Inform. Theory, available online under http://www.arxiv.org/abs/cs.IT/0512078, Dec. 2005.
10. 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, Oct. 10-13 2004.
11. J. Feldman, Decoding Error-Correcting Codes via Linear Programming. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 2003.
12. 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.
13. J. Feldman, D. R. Karger, and M. J. Wainwright, "Linear programming-based decoding of turbo-like codes and its relation to iterative approaches," in Proc. 40th Allerton Conf. on Communications, Control, and Computing, (Allerton House, Monticello, Illinois, USA), October 2-4 2002.
14. M. Wainwright, T. Jaakkola, and A. Willsky, "MAP estimation via agreement on trees: Message-passing and linear programming approaches," in Proc. 40th Allerton Conf. on Communications, Control, and Computing, (Allerton House, Monticello, Illinois, USA), October 2-4 2002.
15. R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Codes. New York, NY: IEEE Press, 1999.
16. N. Wiberg, Codes and Decoding on General Graphs. PhD thesis, Linköping University, Sweden, 1996.
17. G. D. Forney, Jr., R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudo-codewords for codes defi ned 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.
18. P. O. Vontobel, R. Smarandache, N. Kiyavash, J. Teutsch, and D. Vukobratovic, "On the minimal pseudo-codewords of codes from fi nite geometries," in Proc. IEEE Intern. Symp. on Inform. Theory, (Adelaide, Australia), pp. 980-984, Sep. 4-9 2005. Available online under http://www.arxiv.org/abs/cs.IT/0508019.
19. R. Smarandache and P. O. Vontobel, "Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes," submitted to IEEE Trans. Inform. Theory, available online under http://www.arxiv.org/abs/cs. IT/0602089, Feb. 2006.
20. 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.
21. A. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications. San Diego, CA: Academic Press, 1979.