Reproduce “Making Every Edit Count: Efficient Binary Edit Correction at the Gilbert-Varshamov Bound” 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
Ryan Gabrys, Shubhransh Singhvi, Eitan Yaakobi
The authors construct binary codes correcting up to t mixed edits—insertions, deletions, and substitutions—using a shared parity-check hash. They choose separated words in one syndrome class rather than enumerate all binary words. For each fixed error total t and sufficiently large block length n, redundancy is at most 2t log₂ n + O_t(1), with polynomial-time construction, encoding, and decoding.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.