Towards 3-query locally decodable codes of subexponential length
Journal of the ACM | , Vol 55(1): pp. 1-16
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that
one can probabilistically recover any bit xi of the message by querying only q bits of the codeword C(x), even
after some constant fraction of codeword bits has been corrupted.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.