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.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - 2001|
|Event||2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States|
Duration: 24 Jun 2001 → 29 Jun 2001