arXiv (All)
open access
New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21
Let K_q(n,R) denote the minimum cardinality of a q-ary code of length n with covering radius R. We improve the known bounds on K_q(n,R) in 83 cases (82 distinct cells). On the upper-bound side we give 25 improved bounds for 5<=q<=15 -- twenty-four found by search and one propagated by monotonicity -
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
- New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21#920988
- The Optimal Asymptotic Rate of Generalized Covering Codes#793913
- The Optimal Asymptotic Rate of Generalized Covering Codes#789894
- Near-uniform $q$-matroids#1142138
- On the Hamming distance properties of group codes#490073
Record · ID 925224
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