@article{yekhanin2007towards,
author = {Yekhanin, Sergey},
title = {Towards 3-query locally decodable codes of subexponential length},
year = {2007},
month = {January},
abstract = {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.},
publisher = {Association for Computing Machinery, Inc.},
url = {http://approjects.co.za/?big=en-us/research/publication/towards-3-query-locally-decodable-codes-of-subexponential-length/},
pages = {1-16},
journal = {Journal of the ACM},
volume = {55},
edition = {Journal of the ACM},
number = {1},
}