Paperlane

no. 2 · Monday 26 October 2026

A new lower bound for the kissing number in 19 dimensions

Boon Suan Ho

math.MG · v3 · 12 pp

Abstract

We prove that the kissing number in 19 dimensions is at least 11948, improving the bound of Cohn and Li by 256. Their odd-sign construction reduces the problem to finding a binary code of length 19 and minimum distance 5 inside a 5-punctured extended binary Golay code. In an explicit model $D$ of this ambient code, the 21 words of weights 3 and 4 are exactly the pairwise differences that such a code must avoid. They span a 10-dimensional subcode $K$. We exhibit a 6-dimensional subcode $M\le K$ for which all 21 words lie in only five cosets of $M$. After identifying $K/M$ with $\mathbb F_2^4$, these five cosets are represented by $Σ=\{e_1,e_2,e_3,e_4,e_1+e_2+e_3+e_4\}$. In the graph on $\mathbb F_2^4$ in which $u$ and $v$ are adjacent when $u+v\inΣ$, the set $Σ$ itself is independent. Lifting its five vertices gives 320 words in $K$, and translating this set through the four cosets of $K$ in $D$ gives a nonlinear code of size 1280 and minimum distance 5.

comments
12 pages. v3: revised following referee comments; direct proof of the minimum distance, expanded discussion of dimensions 18 and 20, improved exposition; main result unchanged
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2603.10425 ↗