Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Anna Gal & Andrew Mills
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it is sufficient to read a small number of positions of the corresponding, possibly corrupted codeword. A breakthrough result by Yekhanin showed that 3-query linear locally decodable codes may have subexponential length. The construction of Yekhanin, and the three query constructions that followed, achieve correctness only...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.