On the non-minimal codewords in binary Reed–Muller codes Original Research Article

First, we compute the number of non-minimal codewords of weight 2dmin in the binary Reed–Muller code RM(r,m). Second, we prove that all codewords of weight greater than 2m−2m−r+1 in binary RM(r,m), are non-minimal.