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

子空间设计码的结构定理(及快速算法)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes

Massachusetts Institute of Technology(麻省理工学院);University of California, Berkeley(加州大学伯克利分校)

Rohan Goyal, Venkatesan Guruswami

AI总结:

本文提出了一种高效的算法,用于子空间设计码的列表恢复,通过紧凑描述实现高效处理,改进了现有算法性能。

摘要:

错误校正码的列表恢复已成为一个基础概念,在编码理论和理论计算机科学中有着广泛的应用。折叠雷德所莫尔(FRS)和单变量多重性码是显式构造,可以高效地在接近容量的错误分数下进行列表恢复,即错误分数接近$1-R$,其中$R$是编码率。陈和张以及相关工作表明,折叠雷德所莫尔码和线性码必须在错误分数$1-R-ε$下具有指数级在$1/ε$中的列表大小。这些结果表明,无法在多项式时间内恢复FRS码。与这些限制不同,我们扩展了阿什文库马尔、哈比和斯里瓦斯塔瓦的算法进展,表明即使在列表恢复的情况下列表很大,它们也是高度结构化的。特别是,我们可以输出一个仅包含相关列表的集合的紧凑描述,其大小为$\ell^{O((\log \ell)/ε)}$,同时运行时间仅与$1/ε$成多项式关系(此前已知的紧凑描述由古鲁斯瓦米和王提出,其大小约为$n^{\ell/ε}$)。我们还改进了列表恢复任务的最新算法结果。

英文摘要:

List recovery of error-correcting codes has emerged as a fundamental notion with broad applications across coding theory and theoretical computer science. Folded Reed-Solomon (FRS) and univariate multiplicity codes are explicit constructions which can be efficiently list-recovered up to capacity, namely a fraction of errors approaching $1-R$ where $R$ is the code rate. Chen and Zhang and related works showed that folded Reed-Solomon codes and linear codes must have list sizes exponential in $1/ε$ for list-recovering from an error-fraction $1-R-ε$. These results suggest that one cannot list-recover FRS codes in time that is also polynomial in $1/ε$. In contrast to such limitations, we show, extending algorithmic advances of Ashvinkumar, Habib, and Srivastava for list decoding, that even if the lists in the case of list-recovery are large, they are highly structured. In particular, we can output a compact description of a set of size only $\ell^{O((\log \ell)/ε)}$ which contains the relevant list, while running in time only polynomial in $1/ε$ (the previously known compact description due to Guruswami and Wang had size $\approx n^{\ell/ε}$). We also improve on the state-of-the-art algorithmic results for the task of list-recovery.

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

↑