A new upper bound for codes with a single Hamming distance
Gábor Hegedüs·2024-09-12·via math.CO updates on arXiv.org
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.