Constructing Asymptotically Good Relaxed Locally Correctable Codes with Polylogarithmic Query Complexity

We construct the first asymptotically good relaxed locally correctable codes with polylogarithmic query complexity, bringing the upper bound polynomially close to the lower bound.