arXiv (All)
open access
The Exact Second Generalized Covering Radius of Binary Primitive Triple-Error-Correcting BCH Codes
Let $C_m:=\mathrm{BCH}(3,m)$ be the binary primitive triple-error-correcting BCH code of length $2^m-1$. We determine its second generalized covering radius exactly: $R_2(C_m)=8$ for every $m\geq5$. Equivalently, every two-dimensional syndrome subspace is contained in the binary span of at most eigh
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
- Solutions to Three Conjectures and an Open Problem on Binary BCH Codes#819973
- Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes#819002
- Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes#809010
- Covering 1024 syndromes with 50 columns#780811
- Covering 1024 syndromes with 50 columns#779436
Record · ID 1131636
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