DocumentCode
3275465
Title
Estimates of the distance distribution of codes and designs
Author
Ashikhman, A. ; Barg, Alexander ; Litsyn, Simon
Author_Institution
Lucent Technol. Bell Labs., Murray Hill, NJ, USA
fYear
2001
fDate
2001
Firstpage
111
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
Keywords
binary codes; block codes; polynomials; sequential codes; binomiality range; bounding; code sequences; designs; distance distribution; distance spectrum; dual distance; finite length codes; growing length codes; lower bounds; polynomial method; unrestricted block codes; upper bounds; Binary codes; Block codes; Equations; Polynomials; Tin; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.935974
Filename
935974
Link To Document