Michael Luby

Michael George Luby is a mathematician and computer scientist, research director of the core technologies for transport, communications and storage group at the International Computer Science Institute (ICSI), former VP Technology at Qualcomm, co-founder and former Chief Technology Officer of Digital Fountain. In coding theory he is known for leading the invention of the Tornado codes and the LT codes. In cryptography he is known for his contributions showing that any one-way function can be used as the basis for private cryptography, and for his analysis, in collaboration with Charles Rackoff, of the Feistel cipher construction. His distributed algorithm to find a maximal independent set in a computer network has also been very influential. He has also contributed to average-case complexity.[2]

Michael George Luby
Alma mater
Known for
Scientific career
ThesisMonte-Carlo Methods for Estimating System Reliability[1] (1983)
Doctoral advisorRichard Karp

Luby received his B.Sc. in mathematics from Massachusetts Institute of Technology in 1975. In 1983 he was awarded a Ph.D. in computer science from University of California, Berkeley. In 1996-1997, while at the ICSI, he led the team that invented Tornado codes. These were the first LDPC codes based on an irregular degree design that has proved crucial to all later good LDPC code designs, which provably achieve channel capacity for the erasure channel, and which have linear time encoding and decoding algorithms. In 1998 Luby left ICSI to found the Digital Fountain company, and shortly thereafter in 1998 he invented the LT codes, the first practical fountain codes. Qualcomm acquired Digital Fountain in 2009.[3] As of 2019, Luby is back at ICSI where he heads the Codornices Project, which provides a high performance RaptorQ implementation in C, and does research in the field of wireless networks.

Awards received

Luby's publications have won the 2002 IEEE Information Theory Society Information Theory Paper Award for leading the design and analysis of the first irregular LDPC error-correcting codes,[4] the 2003 SIAM Outstanding Paper Prize for the seminal paper showing how to construct a cryptographically unbreakable pseudo-random generator from any one-way function, and the 2009 ACM SIGCOMM Test of Time Award.[5] In 2016 he was awarded the ACM Edsger W. Dijkstra Prize in Distributed Computing; the prize is given "for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing have been evident for at least a decade", and was awarded to Luby for his work on parallel algorithms for maximal independent sets.

Luby himself won the 2007 IEEE Eric E. Sumner Award together with Amin Shokrollahi "for bridging mathematics, Internet design and mobile broadcasting as well as successful standardization".[6] He was given the 2012 IEEE Richard W. Hamming Medal together with Amin Shokrollahi "for the conception, development, and analysis of practical rateless codes".[7] In 2015, he won the ACM Paris Kanellakis Theory and Practice Award "for groundbreaking contributions to erasure correcting codes, which are essential for improving the quality of video transmission over a variety of networks."[8]

Luby was elected to the National Academy of Engineering in 2014, "for contributions to coding theory including the inception of rateless codes". In 2015 he was elected as a Fellow of the Association for Computing Machinery.[9]

Selected publications

  • Luby, Michael (1986). "A Simple Parallel Algorithm for the Maximal Independent Set Problem". SIAM Journal on Computing. 15 (4): 1036–1053. doi:10.1137/0215074.
  • Luby, Michael (2002). "LT Codes". IEEE Symposium on Foundations of Computer Science: 271–282. doi:10.1109/sfcs.2002.1181950. ISBN 978-0-7695-1822-0.
  • Amin Shokrollahi and Michael Luby (2011). "Raptor Codes". Foundations and Trends in Communications and Information Theory. Now Publishers. 6 (3–4): 213–322. doi:10.1561/0100000060.
  • Shai Ben-David, Benny Chor, Oded Goldreich, and Michael Luby (1989). "On the theory of average-case complexity". Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing (STOC): 204–216.CS1 maint: multiple names: authors list (link)


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.