Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces

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.