Towards 3-query locally decodable codes of subexponential length (2008)

by S Yekhanin
Venue:N → N + with T(∆) = Θ(∆), such that given two natural numbers n and ∆, one can find in time polynomial in n and in ∆ an undirected (multi-)graph G = (V, E) with |V | = n, which