The covering radius of \(R(1,9)\) in \(R(4,9)\)

DOI10.1023/A:1027399606196zbMath0953.94041OpenAlexW2042520002MaRDI QIDQ1923810

Xiang-Dong Hou

Publication date: 13 October 1996

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1027399606196

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (4)

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\)

This page was built for publication: The covering radius of \(R(1,9)\) in \(R(4,9)\)