Klim Efremenko. 3-query locally decodable codes of subexponential length. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. pages 39-44, ACM, 2009. [doi]
@inproceedings{Efremenko09,
title = {3-query locally decodable codes of subexponential length},
author = {Klim Efremenko},
year = {2009},
doi = {10.1145/1536414.1536422},
url = {http://doi.acm.org/10.1145/1536414.1536422},
researchr = {https://researchr.org/publication/Efremenko09},
cites = {0},
citedby = {0},
pages = {39-44},
booktitle = {Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
editor = {Michael Mitzenmacher},
publisher = {ACM},
isbn = {978-1-60558-506-2},
}