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

基于模曲线的优良非线性编码

Excellent nonlinear codes from modular curves

Noam D. Elkies

摘要:

利用有限域上的代数曲线构造了一种新的纠错码。在大小为q 0 ^2的域上亏格g -> infty的模曲线产生的非线性码比从相同曲线获得的线性Goppa码更有效。这些新的代码现在具有已知的字母表大小和差错率的某些范围的最高渐近传输速率。这些新记录代码的理论和可能的实际应用都需要开发新的工具。在理论方面,建立传输速率取决于Schanuel定理应用于渐近最优曲线的函数域的误差估计。在计算方面,代码的实际使用将取决于曲线计算代数几何中新问题的解决方案。

英文摘要:

We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g -> infty over a field of size q0^2 yield nonlinear codes more efficient than the linear Goppa codes obtained from the same curves. These new codes now have the highest asymptotic transmission rates known for certain ranges of alphabet size and error rate. Both the theory and possible practical use of these new record codes require the development of new tools. On the theoretical side, establishing the transmission rate depends on an error estimate for a theorem of Schanuel applied to the function field of an asymptotically optimal curve. On the computational side, actual use of the codes will hinge on the solution of new problems in the computational algebraic geometry of curves.

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

↑