A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Lower bounds on the minimum pseudo-weight of linear codes
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
Preserved Fulltext
We discuss 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
doi:10.1109/isit.2004.1365104
dblp:conf/isit/VontobelK04
fatcat:h7iajxckhbc5hbnhu6eknz3pvy