Answers are grounded in this paper and cite their sources.
By deriving bounds on character sums of Boolean functions and by using the characterizations, due to Kasami , of those elements of the Reed-Muller codes whose Hamming weights are smaller than twice and a half the minimum distance, we derive an improved upper bound on the covering radius of the Reed-Muller code of order 2, and we deduce improved upper bounds on the covering radii of the Reed-Muller codes of higher orders
No takes yet. Share an insight, caveat, or question.
Carlet et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: