Lower bounds on the minimum pseudo-weight of linear codes

P.O. Vontobel, R. Koetter
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.  
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