On the norm and covering radius of the first-order Reed-Muller codes
From MaRDI portal
Publication:4361470
DOI10.1109/18.568715zbMath0899.94029OpenAlexW2107899693MaRDI QIDQ4361470
Publication date: 17 November 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.568715
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (9)
On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\) ⋮ Modified Patterson-Wiedemann construction ⋮ A Super-Set of Patterson--Wiedemann Functions: Upper Bounds and Possible Nonlinearities ⋮ Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class ⋮ The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\) ⋮ A Super-Set of Patterson-Wiedemann Functions – Upper Bounds and Possible Nonlinearities ⋮ Cryptographically significant Boolean functions with five valued Walsh spectra
This page was built for publication: On the norm and covering radius of the first-order Reed-Muller codes
