Venkatesan Guruswami
From Wikipedia, the free encyclopedia
Venkatesan Guruswami | |
Born | 1976 India |
---|---|
Residence | USA |
Nationality | Indian |
Fields | Computer Science |
Institutions | University of Washington |
Alma mater | Indian Institute of Technology Massachusetts Institute of Technology |
Doctoral advisor | Madhu Sudan |
Venkatesan Guruswami (born 1976) is a Computer Scientist at University of Washington in Seattle, USA. He ranked second All India in IIT-JEE in 1993. He completed his undergraduate in Computer Science from IIT Madras and his doctorate from Massachusetts Institute of Technology under the supervision of Madhu Sudan in 2001 [1]. His primary area of research is Computer Science, where he is well-known for his work on Reed–Solomon error correction.
Guruswami was awarded the 2002 ACM Doctoral Dissertation Award for his dissertation List Decoding of Error-Correcting Codes. [2]. This breakthrough PhD thesis introduced an algorithm that allowed for the correction of errors beyond half the minimum distance of the code. It applies to Reed–Solomon codes and more generally to algebraic geometric codes. This algorithm produces a list of codewords (it is a list-decoding algorithm) and is based on interpolation and factorization of polynomials over GF(2m) and its extensions.
[edit] Selected publications
- Guruswami, Venkatesan. "List Decoding of Error-Correcting Codes". Springer Verlag 2004.
- Guruswami, Venkatesan (1999). "Improved decoding of Reed-Solomon and algebraic-geometry codes". IEEE Transactions on Information Theory 45(6).