Relaxation bounds on the minimum pseudo-weight of linear block codes

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Chaichanavong, Panu ^a   Siegel, Paul H ^b  

^a MARVELL SEMICONDUCTOR INC   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; LINEAR PROGRAMMING; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD;

HAMMING WEIGHTS; LINEAR BLOCK CODE; LOWER BOUNDS; MAXIMUM LIKELIHOOD DECODERS; OPTIMIZATION PROBLEMS; PARITY CHECK MATRICES; POLYHEDRAL CONE; PSEUDO WEIGHTS;

BLOCK CODES;

EID: 33744493152     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523448     Document Type: Conference Paper

References (11)

1. S. Boyd and L. Vandenberghe, Convex optimization. Cambridge University Press, 2004.
2. E. Castillo, A. Cobo, F. Jubete, and R. E. Pruneda, Orthogonal Sets and Polar Methods in Linear Algebra. New York: Wiley, 1999.
3. J. Feldman, “Decoding error-correcting codes via linear programming,” Ph.D. dissertation, Massachusetts Institute of Technology, 2003.
4. 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. New York: Springer, 2001, pp. 101-112.
5. B. J. Frey, R. Koetter, and A. Vardy, “Signal-space characterization of iterative decoding,” IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 766-781, Feb. 2001.
6. R. Koetter and P. O. Vontobel, “Graph-covers and iterative decoding of finite-length codes,” in Proc. Int. Conf. on Turbo Codes and Related Topics, Brest, France, 2003, pp. 75-82.
7. S. G. Nash and A. Sofer, Linear and nonlinear programming. McGrawHill, 1996.
8. R. M. Tanner, “Minimum-distance bounds by graph analysis,” IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 808-821, Feb. 2001.
9. R. M. Tanner, D. Sridhara, and T. Fuja, “A class of group-structured LDPC codes,” in Proc. ICSTA, Ambleside, England, 2001.
10. P. O. Vontobel and R. Koetter, “Lower bounds on the minimum pseudo-weight of linear codes,” in Proc. IEEE Int. Symp. Inform. Theory, Chicago, IL, 2004, p. 70.
11. N. Wiberg, “Codes and decoding on general graphs,” Ph.D. dissertation, Linköping University, Sweden, 1996.