Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm
Texte intégral
Documents relatifs
In [4], the author defines a new metric, called skew- metric, which is optimal for skew Reed-Solomon codes defined over any division ring (Maximum Skew Distance codes, Theorem 1
They consider the case where the data is \explained" some algebraic curve Q of low degree in y (but not necessarily a linear polynomial in y).. (1) Then the
Sala, “A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set,” Information Theory, IEEE Transactions on, vol.. Tzeng, “A new procedure for decoding cyclic and
I N 1999, Guruswami and Sudan [3]–[5] extended Sudan’s original approach [6] by introducing multiplicities in the interpolation step of their polynomial-time list decoding pro-
Abstract An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on Alekhnovich’s module min- imisation is
The motivation was a fast realization of the interpolation problem of the Guruswami-Sudan principle, where the block Hankel structure of the set of linear homogeneous equations
In this section, we formulate the decoding of an RS(n, k) code virtually extended to a VIRS (n, k, s) code as a modified GS interpolation problem.. The constraints of the
Similar to the IRS-based scheme we can represent the reformulated Sudan interpolation problem in terms of a Linear Feedback Shift Register problem.. In contrast to the IRS- scheme