Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
Combinatorics
2025-04-10 v1
Abstract
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces.
Keywords
Cite
@article{arxiv.2504.07036,
title = {Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces},
author = {Sihuang Hu and Hexiang Huang and Wei-Hsuan Yu},
journal= {arXiv preprint arXiv:2504.07036},
year = {2025}
}