arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.6660math.NTcs.CCcs.ITmath.IT
收藏

使用窄束类域的最佳速率代数列表译码

Optimal rate algebraic list decoding using narrow ray class fields

Venkatesan Guruswami, Chaoping Xing

摘要:

我们使用类域理论,特别是Drinfeld模块的秩1,构造一个家庭的渐近良好的代数几何(AG)代码在固定的字母。在大小为$\ell^2$的字段上,这些代码在单例界限的$2/(\sqrt{\ell}-1)$内。这些代码下的函数域是具有某些函数域的窄射线类域的循环伽罗瓦群的子域。由此产生的代码使用伽罗瓦群的生成器“折叠”。这概括了早期工作的第一作者折叠AG代码的基础上分圆函数字段。使用Chebotarev密度定理,我们认为在我们的循环扩展的惰性的地方大的程度的丰度,并使用此设计一个线性代数算法来列出解码这些折叠码接近$1-R$的错误分数$R$是率。给定关于函数字段的多项式量的预处理信息,可以在多项式时间内执行列表译码。我们的建设产生的代数代码在常数大小的字母表,可以列表解码的Singleton界-具体地说,对于任何所需的速率$R \in (0,1)$和常数$\eps > 0$,我们得到的代码在一个字母表大小$(1/\eps)^{O(1/\eps^2)}$,可以列表解码的错误分数$1-R-\eps$限制附近的消息的子空间与$N^{O(1/\eps^2)}$元素。以前的结果列表译码错误分数$1-R-\eps$在恒定大小的字母是基于级联或涉及采取仔细抽样的子码的代数几何码。相反,我们的结果表明,这些折叠代数几何码{PDMATHAMV本身}具有所要求的列表译码性质.

英文摘要:

We use class field theory, specifically Drinfeld modules of rank 1, to construct a family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. Over a field of size $\ell^2$, these codes are within $2/(\sqrt{\ell}-1)$ of the Singleton bound. The functions fields underlying these codes are subfields with a cyclic Galois group of the narrow ray class field of certain function fields. The resulting codes are "folded" using a generator of the Galois group. This generalizes earlier work by the first author on folded AG codes based on cyclotomic function fields. Using the Chebotarev density theorem, we argue the abundance of inert places of large degree in our cyclic extension, and use this to devise a linear-algebraic algorithm to list decode these folded codes up to an error fraction approaching $1-R$ where $R$ is the rate. The list decoding can be performed in polynomial time given polynomial amount of pre-processed information about the function field. Our construction yields algebraic codes over constant-sized alphabets that can be list decoded up to the Singleton bound --- specifically, for any desired rate $R \in (0,1)$ and constant $\eps > 0$, we get codes over an alphabet size $(1/\eps)^{O(1/\eps^2)}$ that can be list decoded up to error fraction $1-R-\eps$ confining close-by messages to a subspace with $N^{O(1/\eps^2)}$ elements. Previous results for list decoding up to error-fraction $1-R-\eps$ over constant-sized alphabets were either based on concatenation or involved taking a carefully sampled subcode of algebraic-geometric codes. In contrast, our result shows that these folded algebraic-geometric codes {\em themselves} have the claimed list decoding property.

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

↑