DocumentCode
2269442
Title
On the second moment of the distance distribution of binary codes
Author
Roth, Ron M. ; Seroussi, Gadiel
Author_Institution
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa
fYear
2005
fDate
4-9 Sept. 2005
Firstpage
931
Lastpage
935
Abstract
Lower bounds are presented on the second moment of the distance distribution of binary codes. These bounds are used to obtain upper bounds on the size of codes whose maximum distance is close to their minimum distance. It is shown how such results can be applied to bound from below the smallest attainable ratio between the maximum distance and the minimum distance of codes. Improved bounds are then provided for the special case of constant-weight codes
Keywords
binary codes; statistical distributions; binary codes; constant-weight codes; distance distribution; Binary codes; Bismuth; Computer science; Hamming distance; Laboratories; Linear programming; Milling machines; Particle measurements; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location
Adelaide, SA
Print_ISBN
0-7803-9151-9
Type
conf
DOI
10.1109/ISIT.2005.1523474
Filename
1523474
Link To Document