On Bounded-Weight Error-Correcting Codes
Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
TL;DR
This paper computationally derives optimal bounded-weight binary error-correcting codes for various parameters, compares their sizes to constant-weight codes, and analyzes the differences to enhance coding theory understanding.
Contribution
It introduces a computational method to find optimal bounded-weight codes and compares them with existing constant-weight codes, providing new insights into their relative sizes.
Findings
Bounded-weight codes can be optimized for specific parameters.
Optimal bounded-weight codes are often smaller than constant-weight codes.
The size differences depend on the code parameters and bounds.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Complexity and Algorithms in Graphs