Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes |
| |
Authors: | Carlet C Mesnager S |
| |
Affiliation: | Projet CODES, INRIA, Le Chesnay; |
| |
Abstract: | 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 |
| |
Keywords: | |
|
|