Lower bounds on the minimum pseudo-weight of linear codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 70-

  Vontobel, Pascal O ^a   Koetter, Ralf ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR CODES; LINEAR FUNCTIONS; PARITY-CHECK MATRIX;

EIGENVALUES AND EIGENFUNCTIONS; ERROR CORRECTION; FUNCTIONS; LINEAR PROGRAMMING; MATRIX ALGEBRA; VECTORS;

BINARY CODES;

EID: 5044247072     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

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.
2. N. Wiberg, Codes and Decoding on General Graphs. PhD thesis, Linköping University, Sweden, 1996.
3. R. M. Tanner, "Minimum-distance bounds by graph analysis," IEEE Trans. on Inform. Theory, vol. IT-17, no. 2, pp. 808-821, 2001.
4. J. Feldman, Decoding Error-Correcting Codes via Linear Programming. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 2003.
5. Preprint at http://www.ifp.uiuc.edu/~vontobel.