Article
Cited 4 time in 
Cited 4 time in 
Cited 4 time in
Metadata Downloads
Delsarte's Linear Programming Bound for Constant-Weight Codes SCIE SCOPUS
- Title
- Delsarte's Linear Programming Bound for Constant-Weight Codes
- Date Issued
- 2012-09
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- 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; binary constant-weight codes; Delsarte' s linear programming bound; upper bound
- ISSN
- 0018-9448
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 58, no. 9, page. 5956 - 5962, 2012-09
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- 강병균KANG, BYUNG GYUN
- Dept of Mathematics