arXiv (All)
open access
The Covering Radius of the Reed--Muller Code RM(1,9) is 242
What is the covering radius of the Reed--Muller code RM(1,9) ? This is a long-standing open problem in cryptography and coding theory. In this paper, we resolve this problem, and prove that the covering radius of RM(1,9) is 242. We exclude nonlinearity 244 by obtaining a cubic Boolean function achie
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049
- Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting#388253
- Perfect Combinatorial Structures in Coding Theory and Cryptography#1069934
- Cryptography based on error correcting codes#460193
- Insdel Reed-Solomon Decoding Algorithms up to the Half-Singleton Bound#1326663
Record · ID 1343072
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive