On the non-minimality of the largest weight codewords in the binary Reed-Muller codes

DOI10.3934/AMC.2011.5.333zbMATH Open1247.94046OpenAlexW1985425376MaRDI QIDQ2275886

Andreas Klein, Leo Storme

Publication date: 10 August 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2011.5.333

zbMATH Keywords

Reed-Muller codesminimal codewords

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial structures in finite projective spaces (51E20) Authentication, digital signatures and secret sharing (94A62)

This page was built for publication: On the non-minimality of the largest weight codewords in the binary Reed-Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275886)