DocumentCode
2051601
Title
Lower bounds on the minimum pseudoweight of linear codes
Author
Vontobel, Pascal O. ; Koetter, Ralf
Author_Institution
Dept. of Electr. & Comput. Eng., Illinois Univ., Champaign, IL, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
70
Abstract
This paper discusses the two techniques for obtaining lower bounds on the (AWGN channel) pseudo-weight of binary linear codes. Whereas the first bound is based on the largest and second-largest eigenvalues of a matrix associated with the parity-check matrix of a code, the second bound is given by the solution to a linear program.
Keywords
AWGN channels; binary codes; eigenvalues and eigenfunctions; linear codes; matrix algebra; parity check codes; pseudonoise codes; AWGN channel; binary linear code; eigenvalue matrix; linear program; lower bound; minimum pseudoweight code; parity-check code; AWGN channels; Binary codes; Decoding; Eigenvalues and eigenfunctions; Hamming weight; Linear code; Linear programming; Parity check codes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365104
Filename
1365104
Link To Document