On the Work of Madhu Sudan

Madhu Sudan is the recipient of the 2002 Nevanlinna Prize. Sudan has made fundamental contributions to two major areas of research, the connections between them, and their applications. The first area is Coding Theory. Established by Shannon and Hamming over 50 years ago, it is the mathematical study of the possibility of and the limits on reliable communication over noisy media. The second area is Probabilistically Checkable Proofs (PCPs). By contrast, it is only 10 years old. It studies the minimal resources required for probabilistic verification of standard mathematical proofs. My plan is to briefly introduce these areas, their motivation and foundational questions, and then to explain Sudan’s main contributions to each. Before we get to the specific works of Madhu Sudan, let us start with a couple of comments that will set up the context of his work.

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

[2]  Luca Trevisan,et al.  Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..

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

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

[5]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[6]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[7]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[8]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[10]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[11]  Manuel Blum,et al.  Self-Testing/Correcting with Applications to Numerical Problems , 1993, J. Comput. Syst. Sci..

[12]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

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

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

[15]  Madhu Sudan List decoding: algorithms and applications , 2000, SIGA.

[16]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.