A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Lifted Reed-Solomon codes, introduced by Guo, Kopparty and Sudan in 2013, are known as one of the few families of high-rate locally correctable codes. They are built through the evaluation over the affine space of multivariate polynomials whose restriction along any affine line can be interpolated as a low degree univariate polynomial. In this work, we give a formal definition of their analogues over projective spaces, and we study some of their parameters and features. Local correctingarXiv:1809.00931v1 fatcat:brcnahpejjf2josfm3vngkcpn4