TOPICS
Search

Code Covering Radius

The code covering radius of an error-correcting code C subset= A^n is the greatest Hamming distance of a word to its nearest codeword:

rho(C)=max_(x in A^n)min_(c in C)d_H(x,c).

Here A is the alphabet and d_H is the Hamming distance. A word attaining this greatest distance is a deep hole. Thus Hamming distance balls of radius rho(C) about the codewords cover A^n.

For the first-order Reed-Muller code on nine variables, Wang et al. (2026) proved that rho(RM(1,9))=242.

For the third-order Reed-Muller code on eight variables, Zhao and Wu (2026) proved that rho(RM(3,8))=56.

See also

Boolean Function Nonlinearity, Error-Correcting Code, Hamming Distance, Reed-Muller Code

Explore with Wolfram|Alpha

References

Wang, Q.; Lou, Y.; and Wang, Z. "The Covering Radius of the Reed-Muller Code RM(1,9) Is 242." 13 Oct 2026. https://arxiv.org/abs/2610.17871.Zhao, Z. and Wu, Y. "The Covering Radius of the Reed-Muller Code RM(3,8) Is 56." 2 Nov 2026. https://arxiv.org/abs/2611.03186v1.

Cite this as:

Weisstein, Eric W. "Code Covering Radius." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CodeCoveringRadius.html

Subject classifications