Constant-weight code bounds from spherical code bounds
Paper i proceeding, 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.
error-control
Författare
Erik Agrell
Chalmers, Institutionen för data- och elektroteknik - Chalmers Lindholmen
Alexander Vardy
Kenneth Zeger
Proc. IEEE International Symposium on Information, Sorrento, Italy
391-
0-7803-5857-0 (ISBN)
Ämneskategorier
Data- och informationsvetenskap
DOI
10.1109/ISIT.2000.866689
ISBN
0-7803-5857-0