Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms

Over the past five years a number of algorithms decoding some well-studied error-correcting codes far beyond their "error-correcting radii" have been developed. These algorithms, usually termed as list-decoding algorithms, originated with a list-decoder for Reed-Solomon codes [36,17], and were soon extended to decoders for Algebraic Geometry codes [33,17] and also to some number-theoretic codes [12,6,16]. In addition to their enhanced decoding capability, these algorithms enjoy the benefit of being conceptually simple, fairly general [16], and are capable of exploiting soft-decision information in algebraic decoding [24]. This article surveys these algorithms and highlights some of these features.

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

[2]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[3]  Ronitt Rubinfeld,et al.  Learning Polynomials with Queries: The Highly Noisy Case , 2000, SIAM J. Discret. Math..

[4]  Shuhong Gao,et al.  Computing Roots of Polynomials over Function Fields of Curves , 1999 .

[5]  Daniel Augot,et al.  A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes , 2000, IEEE Trans. Inf. Theory.

[6]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discrete Mathematics.

[7]  Dana Ron,et al.  Chinese remaindering with errors , 2000, IEEE Trans. Inf. Theory.

[8]  Venkatesan Guruswami,et al.  List decoding algorithms for certain concatenated codes , 2000, STOC '00.

[9]  Joachim Weickert,et al.  Scale-Space Theories in Computer Vision , 1999, Lecture Notes in Computer Science.

[10]  Luca Trevisan,et al.  Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.

[11]  V. Wei,et al.  Error-Correcting Codes for List Decoding , 1994 .

[12]  W. W. Peterson,et al.  Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.

[13]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

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

[15]  Tom Høholdt,et al.  Bounds on list decoding of MDS codes , 2001, IEEE Trans. Inf. Theory.

[16]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[17]  Venkatesan Guruswami,et al.  On representations of algebraic-geometry codes , 2001, IEEE Trans. Inf. Theory.

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

[19]  D. Grigor'ev,et al.  Factorization of polynomials over a finite field and the solution of systems of algebraic equations , 1986 .

[20]  Arjen K. Lenstra,et al.  Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..

[21]  Erich Kaltofen,et al.  A polynomial-time reduction from bivariate to univariate integral polynomial factorization , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

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

[24]  Luca Trevisan,et al.  Pseudorandom Generators without the XOR Lemma (Abstract). , 1999 .

[25]  Elwyn R. Berlekamp Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.

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

[27]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

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

[29]  Venkatesan Guruswami,et al.  "Soft-decision" decoding of Chinese remainder codes , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[30]  Madhu Sudan,et al.  Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems , 1995, Lecture Notes in Computer Science.

[31]  R. Blahut Theory and practice of error control codes , 1983 .

[32]  David M. Mandelbaum,et al.  On a class of arithmetic codes and a decoding algorithm (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[33]  Venkatesan Guruswami,et al.  Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.

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

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

[36]  Erich Kaltofen,et al.  A polynomial reduction from multivariate to bivariate integral polynomial factorization. , 1982, STOC '82.

[37]  Dan Boneh,et al.  Finding smooth integers in short intervals using CRT decoding , 2000, STOC '00.

[38]  Ronitt Rubinfeld,et al.  Reconstructing Algebraic Functions from Mixed Data , 1998, SIAM J. Comput..