DocumentCode
1538347
Title
Delsarte´s Linear Programming Bound for Constant-Weight Codes
Author
Kang, Byung Gyun ; Kim, Hyun Kwang ; Toan, Phan Thanh
Author_Institution
Department of Mathematics, Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea
Volume
58
Issue
9
fYear
2012
Firstpage
5956
Lastpage
5962
Abstract
We give an alternative proof of Delsarte´s linear programming bound for binary codes and its improvements. Applying the technique which is used in the proof to binary constant-weight codes, we obtain new upper bounds on sizes of binary constant-weight codes.
Keywords
Binary codes; Linear programming; Materials; Polynomials; Upper bound; Vectors; Binary codes; Delsarte´s linear programming bound; binary constant-weight codes; upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2012.2201445
Filename
6216421
Link To Document