Coding Theory: Survey of Recent Progress and Open Questions

Coding theory emerged in the late 1940’s, thanks to the works of Shannon and Hamming, as the theory supporting “reliable transmission of information (in the presence (fear?) of noise)”. More than fifty years since, enormous progress has been made within this theory. At the same time, some of the most central questions remain mysteriously elusive. In this talk we will survey some recent progress, (hopefully) clarify some of the (pervasive?) misconceptions, and lay out some of the classical questions that remain open.

Speaker Details

Madhu Sudan (B.Tech. IIT-Delhi ’87, Ph.D. Berkeley ’92) is a Professor of Computer Science at MIT. His research interests include computational complexity theory, algorithms and coding theory. He is best known for his works on probabilistic checking of proofs, and on the design of list-decoding algorithms for error-correcting codes.Madhu Sudan is a member of the editorial boards of the Journal of the ACM, IEEE Transactions on Information Theory, SIAM Journal on Computing, and Information and Computation, and a member of the scientific board of the Electronic Colloquium on Computational Complexity (ECCC). He was the program committee chair of the IEEE Conference on Computational Complexity ’01, and the IEEE Symposium on Foundations of Computer Science ’03. He is a recipient of numerous awards including the ACM Doctoral Dissertation Award (1992), the IEEE Information Theory Society Paper Award (2000), the Godel Prize (2001), and the Nevanlinna Prize (2002).

Date:
Speakers:
Madhu Sudan
Affiliation:
MIT

    • Portrait of Jeff Running

      Jeff Running

    • Portrait of Madhu Sudan

      Madhu Sudan