On Bounded-Weight Error-Correcting Codes
Information Theory
2007-10-15 v1 math.IT
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.
Cite
@article{arxiv.cs/9906001,
title = {On Bounded-Weight Error-Correcting Codes},
author = {Russell Bent and Michael Schear and Lane A. Hemaspaandra and Gabriel Istrate},
journal= {arXiv preprint arXiv:cs/9906001},
year = {2007}
}
Comments
10 pages, 3 tables