| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118271 | Finite Fields and Their Applications | 2018 | 23 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Phan Thanh Toan, Hyun Kwang Kim, Jaeseon Kim,