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

关于多项式剩余码

On Polynomial Remainder Codes

Jiun-Hung Yu, Hans-Andrea Loeliger

摘要:

多项式剩余码是从中国剩余定理导出的一大类代码,包括里德-所罗门码作为特殊情况。在本文中,我们重新审视这些代码,并研究他们比以前的工作更仔细。我们明确地允许代码符号是不同次数的多项式,这导致了两个不同的权重和距离概念。详细研究了代数译码。如果模不是不可约的,则错误定位器多项式的概念由错误因子多项式代替。然后,我们得到一个集合的gcd为基础的解码算法,其中一些是不太标准的,即使专门为里德-所罗门码。

英文摘要:

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithms, some of which are not quite standard even when specialized to Reed-Solomon codes.

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

↑