On the equivalence of Sudan-decoding and decoding via virtual extension to an interleaved Reed-Solomon code
On the equivalence of Sudan-decoding and decoding via virtual extension to an interleaved Reed-Solomon code
复制标题
苏丹译码与虚拟扩展译码对交错Reed-Solomon码的等价性
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
M. Bossert
中科院分区：
文献类型：
--
作者：
Alexander Zeh;Sabine Kampf;M. Bossert
在本文中，我们研究了两个新的解码方案的里德所罗门码，它允许解码超过一半的最小距离。一个是苏丹的列表解码原则，基于插值与度限制的二元多项式。我们展示了一个基于综合征的方法，我们比较了苏丹的程序与一个计划，是基于扩展的交织Reed-Solomon码。我们提出了理论上的相似之处，并概述了这两种算法在一个独特的可比方式。此外，我们将这两种方案的连接到经典的线性反馈移位寄存器分析。之后，我们比较所考虑的方案的性能。
In this paper we investigate two new decoding schemes for Reed-Solomon codes, which allow to decode beyond half the minimum distance. One is Sudan's list-decoding principle, based on interpolation with a degree-restricted bivariate polynomial. We show a syndrome-based approach of it. We compare Sudan's procedure with a scheme that is based on an extension to Interleaved Reed-Solomon codes. We present theoretical parallels and outline both algorithms in a unique comparable way. Furthermore, we show the connection of both schemes to the classical Linear Feedback Shift Register analysis. Afterwards, we compare the performance of the considered schemes.