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

DOI10.1016/S0166-218X(02)00436-5zbMath1024.94010OpenAlexW2162446076MaRDI QIDQ1811092

Svetla Nikova, Nikolai L. Manev, Yuri L. Borissov

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00436-5

zbMATH Keywords

Boolean functionsBinary Reed-Muller codenon-minimal codewords

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Boolean functions (06E30)

Related Items (4)

Even poset and a parity result for binary linear code ⋮ Secret sharing schemes from binary linear codes ⋮ Minimal codewords in Reed-Muller codes ⋮ Construction of minimal linear codes from multi-variable functions

Cites Work

• Unnamed Item
• Decoding linear block codes for minimizing word error rate (Corresp.)
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• Minimal vectors in linear codes
• Voronoi regions for binary linear block codes
• On the weight structure of Reed-Muller codes

This page was built for publication: On the non-minimal codewords in binary Reed-Muller codes