Paperlane

no. 11 · Monday 9 November 2026

The maximum size of $3$-distance binary codes

Valjakas Djaljapayan, Hao Huang and Wei-Hsuan Yu

math.CO

Abstract

In this paper, we show that for every positive integer $n \ge 24$, the maximum size of a family $\mathcal{F}$ of vectors from $\{-1,1\}^n$ with at most three distinct Hamming distances is equal to $\binom{n}{3}+n$. The threshold $n=24$ is best possible.

fields
Combinatorics
pdf ↗ page arXiv:2611.09675 ↗