Article

A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation

Dept. of Electr. & Electron. Eng., Univ. of Melbourne, Melbourne, VIC, Australia
IEEE Transactions on Information Theory (Impact Factor: 2.62). 11/2011; DOI: 10.1109/TIT.2011.2165803
Source: arXiv

ABSTRACT In this paper, we present a minimal list decoding algorithm for Reed-Solomon (RS) codes. Minimal list decoding for a code C refers to list decoding with radius L, where L is the minimum of the distances between the received word r and any codeword in C. We consider the problem of determining the value of L as well as determining all the codewords at distance L. Our approach involves a parametrization of interpolating polynomials of a minimal Gröbner basis G . We present two efficient ways to compute G. We also show that so-called re-encoding can be used to further reduce the complexity. We then demonstrate how our parametric approach can be solved by a computationally feasible rational curve fitting solution from a recent paper by Wu. Besides, we present an algorithm to compute the minimum multiplicity as well as the optimal values of the parameters associated with this multiplicity, which results in overall savings in both memory and computation.

0 Bookmarks
 · 
75 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya $C_{ab}$ curves proposed by Lee, Bras-Amor\'os and O'Sullivan to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capability and half the minimum distance lower bound by Andersen and Geil that has not been done in the original proposal except for one-point Hermitian codes, remove the unnecessary computational steps so that it can run faster, and analyze its computational complexity in terms of multiplications and divisions in the finite field. As a unique decoding algorithm, the proposed one is as fast as the BMS algorithm for one-point Hermitian codes, and as a list decoding algorithm it is much faster than the algorithm by Beelen and Brander.
    03/2012;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. By using the same principle, we also generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya $C_{ab}$ curves proposed by Lee, Bras-Amor\'os and O'Sullivan to general one-point AG codes, without any assumption. Finally we extend the latter unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capability and half the minimum distance lower bound by Andersen and Geil that has not been done in the original proposal, and remove the unnecessary computational steps so that it can run faster.
    CoRR. 01/2012; abs/1201.6248.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We derive the Wu list-decoding algorithm for Generalised Reed-Solomon (GRS) codes by using Gr\"obner bases over modules and the Euclidean algorithm (EA) as the initial algorithm instead of the Berlekamp-Massey algorithm (BMA). We present a novel method for constructing the interpolation polynomial fast. We give a new application of the Wu list decoder by decoding irreducible binary Goppa codes up to the binary Johnson radius. Finally, we point out a connection between the governing equations of the Wu algorithm and the Guruswami-Sudan algorithm (GSA), immediately leading to equality in the decoding range and a duality in the choice of parameters needed for decoding, both in the case of GRS codes and in the case of Goppa codes.
    IEEE Transactions on Information Theory 11/2012; · 2.62 Impact Factor

Full-text (2 Sources)

View
1 Download
Available from