arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.6008cs.ITmath.IT
收藏

单点Hermitian码的次二次译码

Sub-quadratic Decoding of One-point Hermitian Codes

Johan S. R. Nielsen, Peter Beelen

摘要:

本文给出了单点Hermitian码的前两个次二次复杂度译码算法。第一个是基于快速实现的Guruswami苏丹算法,使用国家的最先进的算法,从计算机代数多项式环矩阵最小化。第二个是一个权力解码算法:经典的关键方程解码的扩展,它给出了一个概率解码算法的苏丹半径。我们将展示如何得到的关键方程可以解决相同的方法从计算机代数,产生类似的渐近复杂性。

英文摘要:

We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realisation of the Guruswami-Sudan algorithm by using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimisation. The second is a Power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the same methods from computer algebra, yielding similar asymptotic complexities.

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

↑