Reproduce “Reed-Muller Codes are Optimal Binary Linear 3-Query LCCs” 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
Oliver Janzer, Peter Manohar
The authors prove a length lower bound for binary linear three-query locally correctable codes, which recover a requested symbol after corruption using at most three reads. They turn repair relations into a colored graph and use mixing to force a cycle forbidden by linearity. It is 2^{Ω(δ⁷√k)}, matching the square-root exponent of quadratic Reed–Muller codes; its δ dependence is not optimized.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.