Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes

We investigate the decoding region for algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to be larger than that of Guruswami-Sudan (GS) hard-decision decoding for a subset of low and medium-rate codes. These results are also extended to multivariable interpolation in the sense of Parvaresh and Vardy.

[1]  Krishna R. Narayanan,et al.  Performance analysis of algebraic soft decoding of reed-solomon codes over binary symmetric and erasure channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[2]  Frank R. Kschischang,et al.  Applications of algebraic soft-decision decoding of Reed-Solomon codes , 2006, IEEE Transactions on Communications.

[3]  Venkatesan Guruswami,et al.  Explicit capacity-achieving list-decodable codes , 2005, STOC.

[4]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[5]  Jørn Justesen.  Soft-decision decoding of RS codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

[8]  Frank R. Kschischang,et al.  Applications of Algebraic Soft-Decision Decoding of Reed–Solomon Codes , 2006 .

[9]  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).

[10]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[11]  A. Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[12]  Alexander Vardy,et al.  Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[13]  Robert J. McEliece,et al.  Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes , 2003, Algebraic Coding Theory and Information Theory.

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

[15]  A. Vardy,et al.  Multiplicity assignments for algebraic soft-decoding of reed-solomon codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[16]  Ralf Koetter.  On optimal weight assignmnents for multivariate interpolation list-decoding , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[17]  Ralf Koetter,et al.  Exponential error bounds for algebraic soft-decision decoding of Reed-Solomon codes , 2004, IEEE Transactions on Information Theory.