arXiv:2611.00070v1 Announce Type: new Abstract: Let $\text{RM}(r,n)$ be the $r$th order Reed-Mullet code of length $2^n$, and let $\rho(r,n)$ denote its covering radius. It is known that $242\le\rho(1,9)\le 244$, and the determination of $\rho(1,9)$ is a long-standing open question. We give a computer-assisted proof that $\rho(1,9)=242$, leveraging the classification of the $349$ orbits in $\text{RM}(3,9)/\text{RM}(2,9)$ under $\text{GL}(9,2)$ [1,3]. The notebook to verify the computer search portion, Verify_RM(1,9).ipynb, contains all data and recomputes each check, and may be found in the repository https://github.com/FreemanSlaughter/Covering-Radius.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page