Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof
From MaRDI portal
Publication:1914016
DOI10.1006/jcta.1996.0055zbMath0849.94027OpenAlexW1996191578MaRDI QIDQ1914016
Publication date: 9 July 1996
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.0055
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (8)
On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\) ⋮ Some algebraic questions about the Reed-Muller code ⋮ On metric regularity of Reed-Muller codes ⋮ Asymptotically optimal Boolean functions ⋮ ON METRIC COMPLEMENTS AND METRIC REGULARITY IN FINITE METRIC SPACES ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ Highly nonlinear functions ⋮ The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
This page was built for publication: Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof
