On Bounded-Weight Error-Correcting Codes
arXiv:cs/9906001
Abstract
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting codes, and evaluate the differences.
arXiv comment10 pages, 3 tables