Estimates of the neighborhood volumes of binary codes via their weight spectra

We obtain two-sided estimates for the number of elements in the $r$-neighborhood of a code via the spectrum of distances between codewords. For the first and second order Reed–Muller codes the estimates are more explicit. A short review of codes with known distance spectrum is given and some applications of the coding theory to cryptography are discussed.