Venkatesan Guruswami

Venkatesan Guruswami

Infobox_Scientist
name = Venkatesan Guruswami


caption =
birth_date = 1976
birth_place = India
residence = USA
nationality = Indian
field = Computer Science
work_institution = 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 [http://people.csail.mit.edu/madhu/] . His primary area of research is Computer Science, where he is well-known for his work on error-correcting codes.

Guruswami was awarded the 2002 ACM Doctoral Dissertation Award for his dissertation "List Decoding of Error-Correcting Codes". [http://www1.acm.org/awards/dd_citation/2002.html] . 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(2^m) and its extensions.

Selected publications

*cite journal|last = Guruswami|first = Venkatesan|title = List Decoding of Error-Correcting Codes|journal = Springer Verlag 2004| url = http://www.springer.com/computer/foundations/book/978-3-540-24051-8
*cite journal|last = Guruswami|first = Venkatesan|title = Improved decoding of Reed-Solomon and algebraic-geometry codes|journal = IEEE Transactions on Information Theory |volume = 45(6)|date = 1999|url = http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/18/16978/00782097.pdf

Notes

External links

* [http://www.cs.washington.edu/homes/venkat/ Venkatesan Guruswami's Homepage]
* [http://www.genealogy.ams.org/id.php?id=55201 Mathematics Genealogy Project]


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Probabilistically checkable proof — In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm… …   Wikipedia

  • Reed–Solomon error correction — Reed Solomon error correction is an error correcting code that works by oversampling a polynomial constructed from the data. The polynomial is evaluated at several points, and these values are sent or recorded. Sampling the polynomial more often… …   Wikipedia

  • Padma Seshadri Bala Bhavan — Senior Secondary School Knowledge Is Power Location Chennai India …   Wikipedia

  • PCP-Theorem — Das PCP Theorem ist ein Satz aus der theoretischen Informatik (Komplexitätstheorie). Es beruht auf dem Konzept des zufällig verifizierbaren Beweises eines mathematischen Satzes (probabilistic checkable proof, PCP), der wiederum auf das Konzept… …   Deutsch Wikipedia

  • Sanjeev Arora — (* 1968 in Indien) ist ein indischer Informatiker. Inhaltsverzeichnis 1 Leben 2 Schriften 3 Literatur 4 Weblinks …   Deutsch Wikipedia

  • List of mathematicians (G) — NOTOC Gab * Gabai, David (?, ? ) * Gage, Paul (?, ? ) * Gage, Walter (Canada, 1922 1978) * Gaitsgory, Dennis (USA, ? ) * Galambos, Janos (USA/Hungary, 1940 ) * Gale, David (USA, 1921 2008) * Galerkin, Boris Grigoryevich (Russia, 1871 1945) *… …   Wikipedia

  • Periyar E. V. Ramasamy — For other uses, see Periyar (disambiguation). Periyar E. V. Ramasamy Periyar E. V. Ramasamy during his early life as a merchant Born 17 September 1879(1879 09 17) Erode, Madras P …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”