Metraipolis › archive › dc_7407980bbd5c

The Covering Radius of the Reed--Muller Code \texorpdfstring{$\RM(3,8)$}{RM(3,8)} is 56 — arXiv:2611.03186

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03186
License (as archived)
CC0-1.0
Archived
2026-11-03T11:38:47.606Z
SHA-256 of the archived text
c6f3b1f5bc13089a6eb1f392a4765533d1ba5886b40ad43b6b2052cca0cd6eaf
Stable URL of this page
https://metraipolis.com/documento/dc_7407980bbd5c

How to cite

The Covering Radius of the Reed--Muller Code \texorpdfstring{$\RM(3,8)$}{RM(3,8)} is 56 — arXiv:2611.03186 — arXiv (en), https://arxiv.org/abs/2611.03186 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7407980bbd5c (Metraipolis archive dc_7407980bbd5c, sha256 c6f3b1f5bc13089a6eb1f392a4765533d1ba5886b40ad43b6b2052cca0cd6eaf)
BibTeX
@misc{dc7407980bbd5c,
  title = {The Covering Radius of the Reed--Muller Code texorpdfstring$RM(3,8)$RM(3,8) is 56 — arXiv:2611.03186},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03186},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7407980bbd5c; sha256 c6f3b1f5bc13089a6eb1f392a4765533d1ba5886b40ad43b6b2052cca0cd6eaf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03186. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that the covering radius of the third-order Reed--Muller code in eight variables is fifty-six. The proof separates even- and odd-weight inputs by moment-controlled slicing. On the even side, a transport invariant on quadratic-label stars and consistency of singleton restrictions give a compatible cubic correction. On the odd side, symmetry of the third moment yields a covariance-rank obstruction. Its rank-two exception is a quartic plus three points of a two-plane; the zero-second-moment case is a prescribed-point perturbation of a quintic. We prove that every such point perturbation has third-order nonlinearity at most fifty-five by a marked derivative identity and complete restriction-code covers. Consequently the maximum among exact-degree-eight functions is fifty-five. The structural reductions are proved analytically, and complete finite certificates verify the explicitly stated local covering and compatibility assertions. The matching lower bound follows from the published quartic relative radius.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.03186 — 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-03T11:05:37.200Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).