Estimates of the distance distribution of codes and designs

A. Ashikhmin, A. Barg, S. Litsyn

Research output: Contribution to journalConference articlepeer-review

Abstract

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 derive several upper and lower bounds both for finite length and for sequences of codes of growing length. We also 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)111
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2001
Externally publishedYes
Event2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States
Duration: 24 Jun 200129 Jun 2001

Fingerprint

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

Cite this