Estimates of the Distance Distribution of Codes and Design

We consider the problem of bounding the distance distribution for unrestricted block codes with known distance and/or dual distance. By an application of the polynomial method we derive several upper and lower bounds both for finite length and for sequences of codes of growing length. We provide a general framework for previously known results and improve the known estimates of the distance distribution.