Tight Lower Bounds for 2-query LCCs over Finite Fields

A Locally Correctable Code (LCC) is an error correcting code that has a probabilistic self-correcting algorithm that, with high probability, can correct any coordinate of the codeword by looking at only a few other coordinates, even if a fraction δ of the coordinates are corrupted. LCCs are a stronger form of LDCs (Locally Decodable Codes) which have received a lot of attention recently due to their many applications and surprising constructions. In this work we show a separation between 2-query LDCs and LCCs over finite fields of prime order. Specifically, we prove a lower bound of the form p^{Ω(δd)} on the length of linear 2-query LCCs over $\F_p$, that encode messages of length d. Our bound improves over the known bound of $2^{Ω(δd)} \cite{GKST06, KdW04, DS07} which is tight for LDCs. Our proof makes use of tools from additive combinatorics which have played an important role in several recent results in theoretical computer science. Corollaries of our main theorem are new incidence geometry results over finite fields. The first is an improvement to the Sylvester-Gallai theorem over finite fields \cite{SS10} and the second is a new analog of Beck's theorem over finite fields.

[1]  Imre Z. Ruzsa,et al.  Sums of Finite Sets , 1996 .

[2]  Sergey Yekhanin,et al.  Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..

[3]  Felix Schlenk,et al.  Proof of Theorem 3 , 2005 .

[4]  Yuval Ishai,et al.  On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR , 2007, APPROX-RANDOM.

[5]  Luca Trevisan,et al.  Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[6]  Noga Alon,et al.  Perturbed Identity Matrices Have High Rank: Proof and Applications , 2009, Combinatorics, Probability and Computing.

[7]  Zeev Dvir,et al.  On Matrix Rigidity and Locally Self-correctable Codes , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[8]  Shubhangi Saraf,et al.  Blackbox Polynomial Identity Testing for Depth 3 Circuits , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Endre Szemerédi,et al.  A statistical theorem of set addition , 1994, Comb..

[10]  Nitin Saxena,et al.  From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, FOCS.

[11]  Benny Sudakov,et al.  On a question of Erdős and Moser , 2005 .

[12]  References , 1971 .

[13]  Nitin Saxena,et al.  From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[14]  József Beck,et al.  On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry , 1983, Comb..

[15]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[16]  Avi Wigderson,et al.  Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes , 2010, STOC '11.

[17]  W. T. Gowers,et al.  A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .

[18]  Zeev Dvir,et al.  Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..