arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.06385cs.CC
收藏

局部可译码中$\ell_1^k$的嵌入

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

Jop Briët

摘要:

我们表明,任何$q$查询本地可解码的代码(LDC)给出了一个副本的$\ell_1^k$与小失真的Banach空间中的$q$ -线性形式的$\ell_{p_1}^N\times\cdots\times\ell_{p_q}^N$,提供$1/p_1 + \cdots + 1/p_q \leq 1$和其中$k$,$N$,和失真是简单的功能的代码参数。我们展示了$\ell_1^k$的副本,它直接从“平滑”LDC解码器构建的基础。在此基础上,我们给出了2-查询最不发达国家的长度的已知下界的替代证明。使用类似的技术,我们reprove已知的下限较大的$q$。我们还讨论了关系的替代证明,由于皮西尔,结果Naor,Regev,和作者的cotype性质的投影张量积的$\ell_p$空间。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑