Estimates of the distance distribution of codes and designs

A. Ashikhmin*, A. Barg, S. Litsyn

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We consider the problem of bounding the distance distribution for unrestricted block codes with known distance and/or dual distance. Applying the polynomial method, we provide a general framework for previously known results. We derive several upper and lower bounds both for finite length and for sequences of codes of growing length. Asymptotic results in the paper improve previously known estimates. In particular, we prove the best known bounds on the binomiality range of the distance spectrum of codes with a known dual distance.

Original languageEnglish
Pages (from-to)1050-1061
Number of pages12
JournalIEEE Transactions on Information Theory
Issue number3
StatePublished - Mar 2001
Externally publishedYes


  • Binomial spectrum
  • Constant weight codes
  • Distance distribution
  • Krawtchouk polynomials
  • Polynomial method


Dive into the research topics of 'Estimates of the distance distribution of codes and designs'. Together they form a unique fingerprint.

Cite this