Metraipolis › archive › dc_46ca6dfc42f3
The covering radius of the first-order Reed-Muller code in nine variables is 242 — arXiv:2611.00890
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00890
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:50:53.639Z
- SHA-256 of the archived text
6c50ecf0bcccbaf0ae90edaf10fd8a001aa6ab2da58298a4cce8bdb0f1912bf0- Stable URL of this page
https://metraipolis.com/documento/dc_46ca6dfc42f3
How to cite
The covering radius of the first-order Reed-Muller code in nine variables is 242 — arXiv:2611.00890 — arXiv (en), https://arxiv.org/abs/2611.00890 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_46ca6dfc42f3 (Metraipolis archive dc_46ca6dfc42f3, sha256 6c50ecf0bcccbaf0ae90edaf10fd8a001aa6ab2da58298a4cce8bdb0f1912bf0)
BibTeX
@misc{dc46ca6dfc42f3,
title = {The covering radius of the first-order Reed-Muller code in nine variables is 242 — arXiv:2611.00890},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00890},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_46ca6dfc42f3; sha256 6c50ecf0bcccbaf0ae90edaf10fd8a001aa6ab2da58298a4cce8bdb0f1912bf0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00890. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that the covering radius of the binary first-order Reed-Muller code RM(1,9) is exactly 242. Equivalently, the maximum nonlinearity of a Boolean function in nine variables is 242. Our proof combines a one-point rigidity theorem with a spectral and computational exclusion of the two larger candidate nonlinearities. We first show that every nine-variable Boolean function of nonlinearity 243 admits a unique one-point modification that raises its nonlinearity to 244: the point to be changed is the vector sum of its support. This part uses exact Walsh-update identities, integer interpolation, rigidity of a quadratic residue, and a sharp Walsh l1 estimate for cubic Boolean functions. To exclude nonlinearity 244, we use Parseval's identity and congruences of integral Walsh coefficients to force an exceptionally restricted spectrum. An associated cubic residue phase must attain the extremal Walsh l1 bound 10240. We eliminate one equality spectrum by hyperplane slicing; the other forces the original Boolean function from the signs of the cubic phase and yields a double-complement-pairing identity for its cubic top part. The classification of alternating trilinear forms over F2, an exact filter of their representatives, and two exhaustive enumerations of 218 quadratic supplements then rule out every remaining candidate. Together with the known construction attaining nonlinearity 242, these arguments establish the asserted covering radius. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Number Theory (math.NT) ; Information Theory (cs.IT); Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.00890 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:15:38.123Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).