arXiv (All)
open access
New lower bounds for binary constant-weight codes from prescribed-automorphism search, and two quantum codes meeting their upper bounds
We give explicit binary constant-weight codes that raise the lower bounds on $A(n,6,w)$ in eight cells of Brouwer's table, all now listed there. The first round (9 October 2026) gave four values: $A(27,6,11)\ge 19305$, $A(27,6,12)\ge 24453$, $A(28,6,10)\ge 18642$ and $A(28,6,9)\ge 11154$, together w
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
- Analytic Maximal Violation of Extended MABK Inequalities for Generalized GHZ States#822452
- The Weight Spectrum of the Affine Grassmann Code $C^{\mathbb A}(3,6)$#987928
- Superlinear Quantum Query Lower Bounds for Subgraph Detection#1154524
- Magic Secret Sharing: Threshold Control of Quantum Computational Power via GHZ Entanglement#1050878
- Editorial: WCC 2024—Workshop on coding and cryptography#159261
Record · ID 1388591
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