Distance Distributions and Energy of Designs in Hamming Spaces

Abstract

We obtain new combinatorial upper and lower bounds for the
potential energy of designs in q-ary Hamming space. Combined with results
on reducing the number of all feasible distance distributions of such designs
this gives reasonable good bounds. We compute and compare our lower
bounds to recently obtained universal lower bounds. Some examples in the
binary case are considered.