Modelling Errors and Recovery for Communication
Madhu Sudan
MIT
Wednesday, November 15, 2006
4:00 p.m. in 1221 CS
(cookies at 3:30 in 2310 CS)
Abstract:
The theory of error-correction has had two divergent schools
of thought, going back to the works of Shannon and Hamming.
In the Shannon school, error is presumed to have been effected
probabilistically. In the Hamming school, the error is modeled
as effected by an all-powerful adversary. The two schools lead
to drastically different limits. In the Shannon model, a binary
channel with error-rate close to, but less than, 50% is useable
for effective communication. In the Hamming model, a binary
channel with an error-rate of more than 25% prohibits unique
recovery of the message.
In this talk, we describe the notion of list-decoding, as a
bridge between the Hamming and Shannon models. This model
relaxes the notion of recovery to allow for a "list of candidates".
We describe results in this model, and then show how these results
can be applied to get unique recovery under "computational
restrictions" on the channel's ability, a model initiated by
R. Lipton in 1994.
Based on joint works with Venkatesan Guruswami (U. Washington),
and with Silvio Micali (MIT), Chris Peikert (MIT) and David
Wilson (MIT).
Speaker's Bio:
Madhu Sudan received his Bachelor's degree from the Indian
Institute of Technology at New Delhi in 1987 and his Ph.D. from
the University of California at Berkeley in 1992. From 1992-1997
he was a Research Staff Member at IBM's Thomas J. Watson Research
Center. In 1997, he moved to MIT where he is now the Fujitsu
Professor of Electrical Engineering and Computer Science.
He was a Fellow at the Radcliffe Institute for Advanced Study from
2003-2004, and a Guggenheim Fellow from 2005-2006.
Madhu Sudan's 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. He
has served on numerous program committees for conferences in
theoretical computer science, and 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
the chief editor of Foundations and Trends in Theoretical Computer
Science, a new journal publishing surveys in the field. He is
currently a member of the editorial boards of the Journal of
the ACM and the SIAM Journal on Computing. Previously he served
on the boards of the SIAM Journal on Discrete Mathematics, Information
and Computation, and the IEEE Transactions on Information Theory.
Madhu Sudan 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).
|