Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed-Solomon Codes

We give a unified hidden-derivative framework for list decoding and mutual correlated agreement of ordinary Reed--Solomon codes over prime fields, on arbitrary prescribed evaluation sets. For every fixed slack $γ>0$, every sufficiently large block length $n$, every prime $q\ge n$, and every dimensio