Reproduce “Explicit Reed-Solomon Subspace Designs: Optimal List and Line Decoding” 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
Omar Alrabiah, Rohan Goyal, Venkatesan Guruswami
The authors explicitly construct Reed–Solomon codes over extension fields with carefully chosen evaluation points. Their field symmetry structure gives a subspace-design guarantee controlling how low-dimensional codeword families shrink when a coordinate is set to zero. This yields list decoding at radius 1-R-ε with list size O((1-R)/ε), plus deterministic decoding. The guarantees require selected points over an extension field.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.