Constant-weight code bounds from spherical code bounds
Paper in proceedings, 2000
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for spherical codes. In particular, we improve upon the 1982 Johnson bound and the linear programming bound for constant-weight codes.
Chalmers, Department of Electrical and Computer Engineering - Chalmers Lindholmen