Reduced Complexity Interpolation for List Decoding Hermitian Codes

List decoding Hermitian codes using the Guruswami-Sudan (GS) algorithm can correct errors beyond half the designed minimum distance. It consists of two processes: interpolation and factorisation. By first defining a Hermitian curve, these processes can be implemented with an iterative polynomial construction algorithm and a recursive coefficient search algorithm respectively. To improve the efficiency of list decoding Hermitian codes, this paper presents two contributions to reduce the interpolation complexity. First, in order to simplify the calculation of a polynomialiquests zero condition during the iterative interpolation, we propose an algorithm to determine the corresponding coefficients between the pole basis monomials and zero basis functions of a Hermitian curve. Second, we propose a modified complexity reducing interpolation algorithm. This scheme identifies any unnecessary polynomials during iterations and eliminates them to improve the interpolation efficiency. Due to the above complexity reducing modifications, list decoding long Hermitian codes with higher interpolation multiplicity becomes feasible. This paper shows list decoding algorithm can achieve significant coding gain over the conventional unique decoding algorithm.

[1]  Martin Johnston,et al.  Efficient Factorisation Algorithm for List Decoding Algebraic-Geometric and Reed-Solomon Codes , 2007, 2007 IEEE International Conference on Communications.

[2]  E. Graeme Chester,et al.  Performance of Reed-Solomon codes using the Guruswami-Sudan algorithm with improved interpolation efficiency , 2007, IET Commun..

[3]  V. D. Goppa.  Codes on Algebraic Curves , 1981 .

[4]  R. Carrasco,et al.  List decoding performance of algebraic geometric codes , 2006 .

[5]  T. R. N. Rao,et al.  Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.

[6]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[7]  Xin-Wen Wu,et al.  Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes , 2001, IEEE Trans. Inf. Theory.

[8]  Tom Høholdt,et al.  Fast decoding of algebraic-geometric codes up to the designed minimum distance , 1995, IEEE Trans. Inf. Theory.

[9]  R. McEliece.  The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes , 2003 .

[10]  Shojiro Sakata,et al.  Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array , 1988, J. Symb. Comput..

[11]  Xin-Wen Wu.  An algorithm for finding the roots of the polynomials over order domains , 2002, Proceedings IEEE International Symposium on Information Theory,.

[12]  Amin Shokrollahi,et al.  List Decoding of Algebraic-Geometric Codes , 1999, IEEE Trans. Inf. Theory.

[13]  Oliver Pretzel,et al.  Codes and Algebraic Curves , 1998 .

[14]  Ian F. Blake,et al.  Algebraic-Geometry Codes , 1998, IEEE Trans. Inf. Theory.

[15]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[16]  Rolando Carrasco,et al.  Construction and performance of algebraic–geometric codes over AWGN and fading channels , 2005 .

[17]  S. G. Vladut,et al.  Algebraic-Geometric Codes , 1991 .

[18]  Ron M. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.

[19]  Rolando Carrasco,et al.  Design of algebraic-geometric codes over fading channels , 2004 .

[20]  Venkatesan Guruswami,et al.  List decoding of error correcting codes , 2001 .

[21]  Tom Høholdt,et al.  Decoding Hermitian Codes with Sudan's Algorithm , 1999, AAECC.

[22]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.