arXiv · 2607.27555
Perfect $2$-codes over arbitrary alphabets
Abstract
The classification of perfect $e$-codes over an arbitrary alphabet of size $q$ is complete for $e > 2$. In the case of non prime power $q$, it is conjectured that no perfect $2$-codes exist. We confirm this conjecture in a number of situations, including the case where $q=2^\alpha p^\beta$ with $p$ prime, $\alpha$ and $\beta$ positive integers, and either $\alpha \leq 20$, or $\alpha$ sufficiently large.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Michael A. Bennett. 2026-07-30. Perfect $2$-codes over arbitrary alphabets. https://arxiv.org/abs/2607.27555
Cite the original work for its findings. Save a collection to share your selection of sources.