On the second moment of the distance distribution of binary codes
Ron M. Roth, G. Seroussi · 2005
Lower bounds are presented on the second moment of the distance distribution of binary codes. These bounds are used to obtain upper bounds on the size of codes whose maximum distance is close to their minimum distance. It is shown how such results can be applied to bound from below the smallest attainable ratio between the maximum distance and the minimum distance of codes. Improved bounds are then provided for the special case of constant-weight codes