We 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 ten...
A k-query locally decodable code (LDC) C: Σn → ΓN encodes each message x into a codeword C(x) such t...
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such th...
Locally decodable codes (LDCs) are error-correcting codes $C : Sigma^k to Sigma^n$ that admit a loca...
latexabstractWe show that any $q$-query locally decodable code (LDC) gives a copy of $\ell_1^k$ wit...
textabstractWe study an approximate version of q-query LDCs (Locally Decodable Codes) over the real ...
We study an approximate version of q-query LDCs (Locally Decodable Codes) over the real numbers and ...
Locally decodable codes (LDCs) are error correcting codes that allow for decoding of a single messa...
Locally decodable codes (LDCs) are error correcting codes that allow for decoding of a single messag...
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such th...
A locally decodable code (LDC) maps $K$ source symbols, each of size $L_w$ bits, to $M$ coded symbol...
Locally decodable codes are error correcting codes with the extra property that, in order to retriev...
It is shown that for every $p\in (1,\infty)$ there exists a Banach space $X$ of finite cotype such t...
A locally decodable code (LDC) C from {0,1} to the k to {0,1} to the n is an error correcting code ...
Abstract. This paper presents essentially optimal lower bounds on the size of linear codes C: {0, 1}...
We prove new lower bounds for locally decodable codes and private information retrieval. We show tha...
A k-query locally decodable code (LDC) C: Σn → ΓN encodes each message x into a codeword C(x) such t...
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such th...
Locally decodable codes (LDCs) are error-correcting codes $C : Sigma^k to Sigma^n$ that admit a loca...
latexabstractWe show that any $q$-query locally decodable code (LDC) gives a copy of $\ell_1^k$ wit...
textabstractWe study an approximate version of q-query LDCs (Locally Decodable Codes) over the real ...
We study an approximate version of q-query LDCs (Locally Decodable Codes) over the real numbers and ...
Locally decodable codes (LDCs) are error correcting codes that allow for decoding of a single messa...
Locally decodable codes (LDCs) are error correcting codes that allow for decoding of a single messag...
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such th...
A locally decodable code (LDC) maps $K$ source symbols, each of size $L_w$ bits, to $M$ coded symbol...
Locally decodable codes are error correcting codes with the extra property that, in order to retriev...
It is shown that for every $p\in (1,\infty)$ there exists a Banach space $X$ of finite cotype such t...
A locally decodable code (LDC) C from {0,1} to the k to {0,1} to the n is an error correcting code ...
Abstract. This paper presents essentially optimal lower bounds on the size of linear codes C: {0, 1}...
We prove new lower bounds for locally decodable codes and private information retrieval. We show tha...
A k-query locally decodable code (LDC) C: Σn → ΓN encodes each message x into a codeword C(x) such t...
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such th...
Locally decodable codes (LDCs) are error-correcting codes $C : Sigma^k to Sigma^n$ that admit a loca...