|Name of the speaker||:||Prof. Jaikumar Radhakrishnan|
|Tata Institute of Fundamental Research, Mumbai|
|Title of the talk||:||" List-decoding Reed-Solomon codes "|
|Day and Date||:||Friday, 29th Feb 2008|
|Venue||:||Ramanujam Hall, Dept. Mathematics|
Each talk in the Popular Lecture Series is meant to convey a basic ideas of a branch of mathematics to the general audience, without assuming any knowledge of the subject. All are welcome.
We will introduce the notion of list-decoding, and discuss the list-decoding algorithms of Sudan, and Guruswami & Sudan for list-decoding Reed-Solomon codes. We will then describe some results on the limits of list-decoding. The talk will involve mainly linear algebra and should be accessible to a general mathematical audience.
About the Speaker : Prof. Jaikumar Radhakrishnan was awarded his Ph.D. degree from Rutgers University in 1991 and he is currently at the School of Technology and Computer Science, TIFR, Mumbai. His main area of research is computational complexity, in particular, on lower bounds, quantum computing and combinatorial and information theoretic methods. During his recent sabbatical at the Toyota Technological Institute, Chicago, he has worked, amongst other things, on lower bounds for Reed-Solomon codes which is the topic of his lecture here.