Amin Shokrollahi

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Amin Shokrollahi (born 1964) is an Iranian mathematician who has worked on a variety of topics including coding theory and algebraic complexity theory. He is best known for his work on iterative decoding of graph based codes for which he received the IEEE Information Theory Paper Award of 2002 (together with Michael Luby, Michael Mitzenmacher, and Daniel Spielman, as well as Tom Richardson and Ruediger Urbanke).[1] He is one of the inventors of a modern class of practical erasure codes known as tornado codes,[2] and the principal developer of raptor codes,[3] which belong to a class of rateless erasure codes known as Fountain codes. In connection with the work on these codes, he received the IEEE Eric E. Sumner Award in 2007 together with Michael Luby "for bridging mathematics, Internet design and mobile broadcasting as well as successful standardization"[4] and the IEEE Richard W. Hamming Medal in 2012 together with Michael Luby "for the conception, development, and analysis of practical rateless codes".[5] He also received the 2007 joint Communication Society and Information Theory Society best paper award for his work on raptor codes.[6]


  1. ^ "Information Theory Paper Award". IEEE Information Theory Society. Retrieved May 20, 2012. 
  2. ^ Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman, Volker Stemann (1997). "Practical Loss-Resilient Codes". Proceedings of the twenty-ninth annual ACM symposium on Theory of computing – STOC '97 (ACM): 150–159. 
  3. ^ Amin Shokrollahi (2006). "Raptor Codes". Transactions on Information Theory (IEEE) 52 (6): 2551–2567. 
  4. ^ "IEEE Eric E. Sumner Award Recipients". IEEE. Retrieved February 27, 2011. 
  5. ^ "IEEE Richard W. Hamming Medal Recipients". IEEE. Retrieved January 5, 2011. 
  6. ^ "IEEE Communications Society & Information Theory Society Joint Paper Award". IEEE Communications Society. Retrieved May 20, 2012.