Improved linear programming bound on sizes of doubly constant-weight codes
SCIE
SCOPUS
- Title
- Improved linear programming bound on sizes of doubly constant-weight codes
- Authors
- Phan Thanh Toan; Kim, Hyun Kwang; Kim, Jaeseon
- Date Issued
- 2018-11
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Abstract
- In this paper we give new constraints on the distance distribution of doubly constant-weight (binary) codes. These constraints improve the linear programming bound on sizes of doubly constant-weight codes. Computations are done for all codes of length n <= 28 and all improved upper bounds are shown. We moreover show that the improved upper bounds give rise to further new upper bounds. (C) 2018 Elsevier Inc. All rights reserved.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/95500
- DOI
- 10.1016/j.ffa.2018.08.009
- ISSN
- 1071-5797
- Article Type
- Article
- Citation
- FINITE FIELDS AND THEIR APPLICATIONS, vol. 54, page. 230 - 252, 2018-11
- 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.