Algorithmic Issues in Coding Theory

The goal of this article is to provide a gentle introduction to the basic definitions, goals and constructions in coding theory. In particular we focus on the algorithmic tasks tackled by the theory. We describe some of the classical algebraic constructions of error-correcting codes including the Hamming code, the Hadamard code and the Reed Solomon code. We describe simple proofs of their error-correction properties. We also describe simple and efficient algorithms for decoding these codes. It is our aim that a computer scientist with just a basic knowledge of linear algebra and modern algebra should be able to understand every proof given here. We also describe some recent developments and some salient open problems.

[1]  Erich Kaltofen,et al.  Polynomial Factorization 1987-1991 , 1992, LATIN.

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

[3]  Ronitt Rubinfeld,et al.  Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[5]  D. Spielman,et al.  Expander codes , 1996 .

[6]  D. Garling,et al.  Algebra, Volume 1 , 1969, Mathematical Gazette.

[7]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

[8]  ChallengesPaul ZimmermannInria Lorrainezimmermann.  Polynomial Factorization , 1996 .

[9]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[10]  Alexander Vardy,et al.  Algorithmic complexity in coding theory and the minimum distance problem , 1997, STOC '97.

[11]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[12]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

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

[14]  Erich Kaltofen.  A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization , 1982, FOCS.

[15]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

[16]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

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

[18]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[19]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

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

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