An upper bound on the size of a code with $s$ distances
Combinatorics
2025-03-13 v1 Information Theory
math.IT
Abstract
Let be a binary code of length with distances . In this note we prove a general upper bound on the size of without any restriction on the distances . The bound is asymptotically optimal.
Keywords
Cite
@article{arxiv.2503.08948,
title = {An upper bound on the size of a code with $s$ distances},
author = {Ivan Landjev and Konstantin Vorobev},
journal= {arXiv preprint arXiv:2503.08948},
year = {2025}
}