Reproduce “An Approximate Coding-Rate Versus Minimum Distance Formula for Binary Codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Yosef Akhtman, Robert G. Maunder, Lajos Hanzo
The authors propose a closed-form, invertible approximation for the relationship between a binary code’s rate and minimum distance. It uses a quadratic at lower distances and a Plotkin-bound expression at higher distances. For length 256 and rate 1/4, it estimates distance 74.4 within known bounds of 65 to 90; across 3,856 tabulated scenarios, its error is below 2.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.