On Embeddings of $\ell_1^k$ from Locally Decodable Codes
Jop Briët
备注:
Appeared earlier on ECCC (http://eccc.hpi-web.de/report/2015/086/). This version has a slightly shorter abstract and slightly edited introduction. Removed left-over notes
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 tensor products of $\ell_p$ spaces.
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument
局部可解码代码将n位串x编码为m位码字C(x),以这样的方式,即可以通过仅查询该字的几位来从损坏的码字中恢复任何位x_i。我们使用量子论证来证明具有2个经典查询的LDCs需要指数长度:m=2^{Omega(n)}。以前,这只适用于线性码(Goldreich et al. 02)。我们的证明表明,一个2查询LDC可以解码只有1个量子查询,然后证明了指数下界,这样的1查询局部量子可解码的代码。我们还表明,q量子查询允许更简洁的最不发达国家比最有名的最不发达国家与q经典查询。最后,我们给出了新的经典下界和量子上界的设置私人信息检索。特别是,我们展示了一个量子2-服务器PIR方案,具有O(n^{3/10})量子比特的通信,改进了最著名的经典2-服务器PIR的O(n^{1/3})比特的通信。
Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
University of Illinois at Chicago(芝加哥伊利诺伊大学);Purdue University(普渡大学);Peking University(北京大学);University of Waterloo(滑铁卢大学);Johns Hopkins University(约翰斯·霍普金斯大学)
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
Purdue University(普渡大学);Center on Frontiers of Computing Studies, Peking University(北京大学前沿计算研究中心);Advanced Institute of Information Technology, Peking University(北京大学信息技术高级研究院);Cheriton School of Computer Science, University of Waterloo(滑铁卢大学切里顿计算机科学学院);Department of Computer Science, Johns Hopkins University(约翰斯·霍普金斯大学计算机科学系)
3-Query RLDCs are Strictly Stronger than 3-Query LDCs
Department of Computer Science and Technology, University of Cambridge(剑桥大学计算机科学与技术系);Department of Mathematics, Massachusetts Institute of Technology(麻省理工学院数学系);EPFL(洛桑联邦理工学院)
利用$\F_2^h$上的Cayley图给出了($\F_2$ -线性)局部可测纠错码的两个新的刻画:\begin{enumerate} \item A locally testable code is equivalent to a Cayley graph over $\F_2^h$ whose set of generators is significantly larger than $h$ and has no short linear dependencies, but yields a shortest-path metric that embeds into $\ell_1$ with constant distortion. This extends and gives a converse to a result of Khot and Naor (2006), which showed that codes with large dual distance imply Cayley graphs that have no low-distortion embeddings into $\ell_1$. \item A locally testable code is equivalent to a Cayley graph over $\F_2^h$ that h…