arXiv · 2608.27494
Covering 1024 syndromes with 50 columns
Abstract
We exhibit a binary linear $[50,40]_2$ code of covering radius $2$, so $\ell_2(10,2)\le 50$, one column below the Kaikkonen--Rosendahl length $51$ that has stood since 2003 and that still seeds the $R=2$ family of Davydov--Marcugini--Pambianco (arXiv:2511.02542). The new matrix admits a $(2,0)$-partition into ten blocks, so Construction $\mathrm{QM}_2^2$ propagates it to exhaustively verified codes of lengths $815$ and $1631$ at $r=18$ and $r=20$, and to the family $n=51\cdot 2^{r/2-5}-1$ of asymptotic density $2601/2048$. The matrices, verifiers, and source are at https://github.com/wustep/maths, pin problems/covering/share/2026-08-24/ at commit 736a38f.
Explore related subjects
Keep this discovery
Stephen Wu. 2026-08-26. Covering 1024 syndromes with 50 columns. https://arxiv.org/abs/2608.27494
Cite the original work for its findings. Save a collection to share your selection of sources.
Discover connections
Connections use source metadata and explicit phrase matches, not verified experimental comparisons.