Abstract
A linear (q, δ, ε, m(n))-locally decodable code (LDC) \(C: \mathbb{F}^n \rightarrow \mathbb{F}^{m(n)}\) is a linear transformation from the vector space \(\mathbb{F}^n\) to the space \(\mathbb{F}^{m(n)}\) for which each message symbol x i can be recovered with probability at least \(\frac{1}{|\mathbb{F}|} + \epsilon\) from C(x) by a randomized algorithm that queries only q positions of C(x), even if up to δm(n) positions of C(x) are corrupted. In a recent work of Dvir, the author shows that lower bounds for linear LDCs can imply lower bounds for arithmetic circuits. He suggests that proving lower bounds for LDCs over the complex or real field is a good starting point for approaching one of his conjectures.
Our main result is an m(n) = Ω(n 2) lower bound for linear 3-query LDCs over any, possibly infinite, field. The constant in the Ω(·) depends only on ε and δ. This is the first lower bound better than the trivial m(n) = Ω(n) for arbitrary fields and more than two queries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. Inform. Theory 42, 1710–1722 (1996)
Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: STOC (2000)
Goldreich, O., Karloff, H.J., Schulman, L.J., Trevisan, L.: Lower bounds for linear locally decodable codes and private information retrieval. In: CCC (2002)
Trevisan, L.: Some applications of coding theory in computational complexity. Quaderni di Matematica 13, 347–424 (2004)
Yekhanin, S.: Locally Decodable Codes and Private Information Retrieval Schemes. PhD thesis, MIT (2007)
Candès, E.J., Romberg, J.K., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory 52, 489–509 (2006)
Donoho, D.L.: Compressed sensing. IEEE Transactions on Information Theory 52, 1289–1306 (2006)
Duarte, M., Davenport, M., Takhar, D., Laska, J., Sun, T., Kelly, K., Baraniuk, R.: Single-pixel imaging via compressing sensing. IEEE Signal Processing Magazine (2008)
Dvir, Z., Shpilka, A.: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. In: Symposium on the Theory of Computing, STOC (2005)
Dvir, Z.: On matrix rigidity and locally self-correctable codes. In: IEEE Conference on Computational Complexity, CCC (2010)
Valiant, L.G.: Graph-theoretic arguments in low-level complexity. In: MFCS, pp. 162–176 (1977)
Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes. In: STOC (2003)
Woodruff, D.P.: New lower bounds for general locally decodable codes. Electronic Colloquium on Computational Complexity (ECCC) 14 (2007)
Obata, K.: Optimal lower bounds for 2-query locally decodable linear codes. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 39–50. Springer, Heidelberg (2002)
Woodruff, D.P.: Corruption and recovery-efficient locally decodable codes. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 584–595. Springer, Heidelberg (2008)
Efremenko, K.: 3-query locally decodable codes of subexponential length. In: STOC (2009)
Itoh, T., Suzuki, Y.: New constructions for query-efficient locally decodable codes of subexponential length (manuscript) (2009)
Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. J. ACM 55 (2008)
Dvir, Z., Gopalan, P., Yekhanin, S.: Matching vector codes. Electronic Colloquium on Computational Complexity, ECCC (2010)
Gopalan, P.: A note on Efremenko’s locally decodable codes. Electronic Colloquium on Computational Complexity, ECCC (2009)
Diestel, R.: Graph theory. Graduate Texts in Mathematics. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woodruff, D.P. (2010). A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2010 2010. Lecture Notes in Computer Science, vol 6302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15369-3_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-15369-3_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15368-6
Online ISBN: 978-3-642-15369-3
eBook Packages: Computer ScienceComputer Science (R0)