Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan. Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. In IEEE Conference on Computational Complexity. pages 175-183, 2002. [doi]
@inproceedings{GoldreichKST02,
title = {Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval},
author = {Oded Goldreich and Howard J. Karloff and Leonard J. Schulman and Luca Trevisan},
year = {2002},
url = {http://computer.org/proceedings/ccc/1468/14680175abs.htm},
tags = {information retrieval},
researchr = {https://researchr.org/publication/GoldreichKST02},
cites = {0},
citedby = {0},
pages = {175-183},
booktitle = {IEEE Conference on Computational Complexity},
}