DMCA
Exponential lower bound for 2-query locally decodable codes via a quantum argument (2003)
Cached
Download Links
- [homepages.cwi.nl]
- [arxiv.org]
- [www.cs.umd.edu]
- [www.cwi.nl]
- DBLP
Other Repositories/Bibliography
by
Iordanis Kerenidis
,
Ronald de Wolf
| Venue: | JOURNAL OF COMPUTER AND SYSTEM SCIENCES |
| Citations: | 134 - 15 self |
BibTeX
@INPROCEEDINGS{Kerenidis03exponentiallower,
author = {Iordanis Kerenidis and Ronald de Wolf},
title = {Exponential lower bound for 2-query locally decodable codes via a quantum argument},
booktitle = {JOURNAL OF COMPUTER AND SYSTEM SCIENCES},
year = {2003},
pages = {106--115},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A locally decodable code encodes n-bit strings x in m-bit codewords C(x) in such a way that one can recover any bit xi from a corrupted codeword by querying only a few bits of that word. We use a quantum argument to prove that LDCs with 2 classical queries require exponential length: m = 2 \Omega (n). Previously this was known only for linear codes (Goldreich et al. 02). The
