Title of article
On the non-minimal codewords in binary Reed–Muller codes Original Research Article
Author/Authors
Yuri Borissov، نويسنده , , Nickolai Manev، نويسنده , , Svetla Nikova، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
10
From page
65
To page
74
Abstract
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.
Keywords
Boolean functions , Non-minimal codewords , Binary Reed–Muller code
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885572
Link To Document