Covering:
Write for the least length of a binary linear code with redundancy and covering radius . A binary linear code of length 50 and dimension 40 has covering radius exactly 2, so
The November 2025 table (Davydov–Marcugini–Pambianco, arXiv:2511.02542, Table 5.1) had .
At radius 3, a 33-block partition of the existing 817-column seed and
Construction QM give , improving Table 7.2's
26238 by 63 columns. The certificate checks all seed syndromes and
every output column; replay with compute/q16/run_all.sh.
The seed argument
The certificate is a parity-check matrix,
compute/H_r10_n50.txt: every syndrome
in is a sum of at most two of its columns
(1024/1024, two independent verifiers). The same matrix has a
-partition with , so the
construction of arXiv:2511.02542 lifts it to longer codes
(, ; , ) and to the density bound
. That is the interesting
part: one finite seed moves the asymptotic constant, not just a
table entry.
Status
Construction, an upper bound. Sphere covering gives only , and an search left 7 holes, so 50 is not shown optimal.
Replay
python compute/verify_certificate.py
cd result && ./run_all.sh
Standalone writeup: result/. Explainers:
HTML, PDF.
What was tried for 49
Still open. Sphere covering only gives . Overnight work on 2026-08-21 did not produce a 49, and it did not produce a lower bound.
Three construction families, none of them a neighbour-search on the 50-set:
- Recover the 2003 Kaikkonen–Rosendahl 51-set and ask whether 51 or 50 is a lift of the record. They are not. Replacing one quotient block of the 50-set by a shorter block does not yield a 49 in any instance that was decided.
- Prescribe an automorphism of odd prime order. No 49-set is invariant under an element of order 7. Combined with a short arithmetic argument, any 49-set has automorphism group a -group. The known 50-set and 51-set are both 2-group symmetric.
- A fibered construction (one column over every nonzero point of a quotient, plus a kernel block). It reproduces the documented lengths at and is completely decided for . At it cannot produce any length ; its own best is 54. The nearest unfinished case in the family is length 38 at , which would beat and was not decided.
Code: compute/q9/, compute/q10/,
compute/q11/.