DocumentCode
1061952
Title
Bounds for Binary Codes With Narrow Distance Distributions
Author
Roth, Ron M. ; Seroussi, Gadiel
Author_Institution
Technion-Israel Inst. of Technol., Haifa
Volume
53
Issue
8
fYear
2007
Firstpage
2760
Lastpage
2768
Abstract
New lower bounds are presented on the second moment of the distance distribution of binary codes, in terms of the first moment of the distribution. These bounds are used to obtain upper bounds on the size of codes whose maximum distance is close to their minimum distance. It is then demonstrated how such bounds can be applied to bound from below the smallest attainable ratio between the maximum distance and the minimum distance of codes. Finally, counterparts of the bounds are derived for the special case of constant-weight codes.
Keywords
binary codes; binary code; constant-weight code; distance distribution; Australia; Binary codes; Cities and towns; Computer science; Hamming distance; Information theory; Laboratories; Linear programming; Materials science and technology; Upper bound; Constant-weight codes; Grey–Rankin bound; distance distribution; equidistant codes; linear programming bound; quasi-symmetric designs; self-complementary codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2007.901192
Filename
4276932
Link To Document