The Closest Pair Problem under the Hamming Metric
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
| Hi-index | 754.84 |
New lower bounds are presented on the second moment of the distance distribution of binary codes, in terms of the first moment of the distribution. These bounds are used to obtain upper bounds on the size of codes whose maximum distance is close to their minimum distance. It is then demonstrated how such bounds can be applied to bound from below the smallest attainable ratio between the maximum distance and the minimum distance of codes. Finally, counterparts of the bounds are derived for the special case of constant-weight codes.