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

随机低速率线性码的列表恢复

List Recovery for Random Low-Rate Linear Codes

UCSB(加州大学圣塔芭芭拉分校);UCLA(加州大学洛杉矶分校)

Isaac M Hair, Amit Sahai

AI总结:

针对足够大素域上的随机低速率线性码,证明了其同时对所有输入列表大小具有列表恢复能力,并给出了近乎最优的下界。

摘要:

我们证明了对于足够大素域上的随机低速率线性码的列表恢复保证。对于固定维度 $d$、错误分数 $α$ 和精度参数 $\varepsilon$,一个随机的 $d$ 维线性码 $C \subseteq \mathbb{F}_p^n$ 以高概率同时对所有输入列表大小 $\ell\le 2^{O_{α, \varepsilon, d}(n/\log n)}$ 是 $(α,\ell, rac{1+\varepsilon}{1-α}\ell)$-列表可恢复的。证明受 Matoušek、Př\'ıvětivý 和 Škovroň 关于从投影重建点集的工作启发。它结合了确定性图论证书、非零行列式准则和 Schwartz–Zippel 引理。我们还给出了一个下界,表明任何维度至少为 2 的线性码 $C \subseteq \mathbb{F}_p^n$ 对于可行的列表大小 $\ell \geq 2^{Ω_{α, \varepsilon}(n)}$ 不能是 $(α,\ell, rac{1+\varepsilon}{1-α}\ell)$-列表可恢复的。在这个意义上,我们的结果几乎是最优的。

英文摘要:

We show that random linear codes of fixed dimension $d$ over sufficiently large prime fields have nearly optimal output list size for list recovery. Fix an error fraction $0<α<1$ and $0<\varepsilon<1$. For all sufficiently large block lengths $n$, with probability at least $1-\varepsilon$, the following holds simultaneously for every input list size $\ell\le 2^{δn/\log n}$, where $δ>0$ depends only on $α,\varepsilon$, and $d$. Given any list of $\ell$ symbols at each coordinate, at most $(1+\varepsilon)\ell/(1-α)$ codewords agree with the lists in at least $(1-α)n$ coordinates. Our proof adapts the colored-graph and determinant arguments of Matousek, Privetivy, and Skovron for reconstructing planar point sets from their projections. We also prove that the range of input list sizes is nearly optimal. There is a constant $c=c(α,\varepsilon)>0$ such that, for every linear code of dimension at least two over a sufficiently large prime field $\mathbb{F}_p$ and every $2^{cn}\le\ell\le p$, there are lists of size $\ell$ and a set of more than $(1+\varepsilon)\ell/(1-α)$ codewords, each of which agrees with those lists in every coordinate. The main results of this paper were discovered by ChatGPT 5.5 Sol using harness components from the UCLA Moonshot Harness Project, in response to a less optimal result found by the authors. See the end of the introduction for a discussion.

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

↑