Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Embeddings of $\ell_1^k$ from Locally Decodable Codes

Published 19 Nov 2016 in cs.CC | (1611.06385v2)

Abstract: We show that any $q$-query locally decodable code (LDC) gives a copy of $\ell_1k$ 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_1k$ 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.

Authors (1)
Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.