The covering radius of the Reed-Muller code RM(2, 7) is 40

DOI10.1016/J.DISC.2019.111625MaRDI QIDQ2329210zbMATH OpenOpenAlexFDO

Authors Qichun Wang

Publication date 17 October 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.04864

zbMATH Keywords

Boolean functionscovering radiusReed-Muller codessecond-order nonlinearity

Mathematics Subject Classification ID

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

Abstract: It was proved by J. Schatz that the covering radius of the second order Reed--Muller code $RM(2,6)$ is 18 (IEEE Trans Inf Theory 27: 529--530, 1985). However, the covering radius of $RM(2,7)$ has been an open problem for many years. In this paper, we prove that the covering radius of $RM(2,7)$ is 40, which is the same as the covering radius of $RM(2,7)$ in $RM(3,7)$. As a corollary, we also find new upper bounds for $RM(2,n)$, $n=8,9,10$.

Recommendations

• New bounds on the covering radius of the second order Reed-Muller code of length 128
• Further results on the covering radii of the Reed-Muller codes
• Some results on the covering radii of Reed-Muller codes
• Some inequalities about the covering radius of Reed-Muller codes
• On the covering radius of binary codes (Corresp.)

Cites work

• 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
• \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• An improved list decoding algorithm for the second order Reed-Muller codes and its applications
• Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof
• Covering radius---Survey and recent results
• Cryptographic Boolean functions and applications
• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 2085196 (Why is no real title available?)
• Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
• New bounds on the covering radius of the second order Reed-Muller code of length 128
• On ``bent functions
• On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
• On the covering radius of R(1, m) in R(3, m)
• On the covering radius of Reed-Muller codes
• On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
• On the norm and covering radius of the first-order Reed-Muller codes
• Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
• Some results on the covering radii of Reed-Muller codes
• The covering radius of \(R(1,9)\) in \(R(4,9)\)
• The Covering Radius of the (m - 3)rd Order Reed Muller Codes and a Lower Bound on the (m - 4)th Order Reed Muller Codes
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
• The second order Reed-Muller code of length 64 has covering radius 18 (Corresp.)
• Weight distributions of the cosets of the (32,6) Reed-Muller code

Cited in

(10)

• On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
• New bounds on the covering radius of the second order Reed-Muller code of length 128
• Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof
• On metric regularity of Reed-Muller codes
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• The Covering Radius of the Reed–Muller Code RM(m – 4, m) in RM(m – 3, m)
• On metric complements and metric regularity in finite metric spaces
• Classification of some cosets of the Reed-Muller code
• Covering radius of RM(4,8)
• Determining the weight spectrum of the Reed-Muller codes \(\mathrm{RM}(m-6, m)\)

This page was built for publication: The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)

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