On Embeddings of 1k from Locally Decodable Codes
Abstract
We show that any q-query locally decodable code (LDC) gives a copy of 1k with small distortion in the Banach space of q-linear forms on p1N×·s×pqN, provided 1/p1 + ·s + 1/pq ≤ 1 and where k, N, and the distortion are simple functions of the code parameters. We exhibit the copy of 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 p spaces.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.