On Embeddings of l1k from Locally Decodable Codes

latexabstractWe show that any $q$-query locally decodable code (LDC) gives a copy of $\ell_1^k$ with small distortion in the Banach space of $q$-linear forms on $\ell_{p_1}^N\times\cdots\times\ell_{p_q}^N$, provided $1/p_1 + \cdots + 1/p_q \leq 1$ and where $k$, $N$, and the distortion are simple functions of the code parameters. We exhibit the copy of $\ell_1^k$ by constructing a basis for it directly from "smooth" LDC decoders. Based on this, we give alternative proofs for known lower bounds on the length of 2-query LDCs. Using similar techniques, we reprove known lower bounds for larger $q$. We also discuss the relation with an alternative proof, due to Pisier, of a result of Naor, Regev, and the author on cotype properties of projective tensor products of $\ell_p$ spaces.

[1]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

[2]  David P. Woodruff.  New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..

[3]  J. Lindenstrauss,et al.  Handbook of geometry of Banach spaces , 2001 .

[4]  A. Buchholz.  Optimal Constants in Khintchine Type Inequalities for Fermions, Rademachers and q-Gaussian Operators , 2005 .

[5]  Zeev Dvir,et al.  Matching Vector Codes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[6]  Ronald de Wolf,et al.  Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.

[7]  Nathan Linial,et al.  On the Vertices of the d-Dimensional Birkhoff Polytope , 2012, Discret. Comput. Geom..

[8]  Zeev Dvir,et al.  2-Server PIR with Sub-Polynomial Communication , 2014, STOC.

[9]  Guangda Hu,et al.  Lower Bounds for Approximate LDCs , 2014, ICALP.

[10]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[11]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[12]  Assaf Naor,et al.  Locally decodable codes and the failure of cotype for projective tensor products , 2012, ArXiv.

[13]  Joe Diestel,et al.  The Metric Theory of Tensor Products (Grothendieck's Résumé Revisited) Part 5: Injective and Projective Tensor Norms , 2003 .

[14]  N. Tomczak-Jaegermann.  The moduli of smoothness and convexity and the Rademacher averages of the trace classes $S_{p}$ (1≤p<∞) , 1974 .

[15]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

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

[18]  Ronald de Wolf,et al.  Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.

[19]  G. Pisier.  The volume of convex bodies and Banach space geometry , 1989 .

[20]  G. Pisier,et al.  Non commutative Khintchine and Paley inequalities , 1991 .

[21]  Ronald de Wolf,et al.  A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[22]  Shubhangi Saraf,et al.  High-rate codes with sublinear-time decoding , 2011, STOC '11.

[23]  Luca Trevisan,et al.  Lower bounds for linear locally decodable codes and private information retrieval , 2006, computational complexity.

[24]  Vince Grolmusz,et al.  Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs , 2000, Comb..

[25]  Rafail Ostrovsky,et al.  Local Correctability of Expander Codes , 2013, ICALP.

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

[27]  Elliott H. Lieb,et al.  An Inequality of Hadamard Type for Permanents , 2005 .

[28]  Sergey Yekhanin.  Towards 3-query locally decodable codes of subexponential length , 2007, STOC '07.

[29]  Avi Wigderson,et al.  Breaking the quadratic barrier for 3-LCC's over the reals , 2013, STOC.

[30]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

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

[32]  Faperj.  Sums of random Hermitian matrices and an inequality by Rudelson , 2010 .

[33]  G. Pisier,et al.  Un théorème sur les opérateurs linéaires entre espaces de Banach qui se factorisent par un espace de Hilbert , 1980 .

[34]  R. Ryan.  Introduction to Tensor Products of Banach Spaces , 2002 .

[35]  Or Meir,et al.  High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2016, STOC.

[36]  S. Mendelson,et al.  Entropy and the combinatorial dimension , 2002, math/0203275.

[37]  B. Maurey,et al.  Chapter 30 - Type, Cotype and K-Convexity , 2003 .

[38]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[39]  Ronald de Wolf.  Error-Correcting Data Structures , 2009, STACS.

[40]  Jessica Schulze,et al.  Efficient Checking Of Polynomials And Proofs And The Hardness Of Approximation Problems , 2016 .

[41]  Luca Trevisan,et al.  Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..