On the distance distribution of codes

The distinct distribution of a binary code C is the sequence (B/sub i/)/sub i=0//sup n/ defined as follows: let B/sub i/(w) be the number of codewords at distance i from the codeword w, and let B/sub i/ be the average of B/sub i/(w) over all w in C. In this correspondence we study the distance distribution for codes of length n and minimal distance /spl delta/n, with /spl delta/>0 fixed and n/spl rarr//spl infin/. Our main aim is to relate the size of the code with the distribution of distances near the minimal distance.<
>