On the covering radius of R(1, m) in R(3, m)

DOI10.1109/18.490572MaRDI QIDQ4887089zbMATH OpenOpenAlexFDO

Authors Xiang-Dong Hou

Publication date 31 July 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.490572

zbMATH Keywords

covering radiusquadratic boundReed-Muller codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cited in

(6)

• On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
• Exact 2-divisibility of exponential sums associated to Boolean functions
• A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
• The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
• New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity
• Covering radius of RM(1,9) in RM(3,9)

This page was built for publication: On the covering radius of R(1, m) in R(3, m)

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