arXiv (All)
open access
Asymptotically Tight Bounds for Generalized Covering Radii of Binary Primitive BCH Codes at All Higher Orders
We study the generalized covering radii of binary primitive BCH codes, which measure how many parity-check columns suffice to span several prescribed syndromes. For the four-error-correcting family of length $2^m-1$, the second radius is exactly $11$ for $m\geq55$, and it is either $11$ or $12$ for
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
- Closed form logical error rate approximations for surface codes#1070820
- Covering 1024 syndromes with 50 columns#780811
- Covering 1024 syndromes with 50 columns#779436
- A new upper bound for Sidon sets in $\mathbb{F}_2^{4k+3}$#1064275
Record · ID 1131650
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