On Bounded-Weight Error-Correcting Codes
classification
💻 cs.IT
math.IT
keywords
codeserror-correctingbinarybounded-weightoptimalsizesboundscompare
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.