On the non-minimal codewords in the binary Reed-Muller code

Y. Borissov, N. Manev, S. Nikova
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)  
We prove that all codewords of weight greater than 2 m − 2 m−r+1 in the binary Reed-Muller code of order r are non-minimal.
doi:10.1109/isit.2001.935902 fatcat:f54sv3ptn5drtotihsxa7kkwua