|
|
 |
Leonard
Schulman,
California Institute of Technology
|
|
|
Tree codes in communication, control and cryptography
|
|
Abstract |
TBD... |
About the Speaker |
Leonard J. Schulman received the B.Sc. in
Mathematics in 1988 and the Ph.D. in Applied Mathematics in 1992, both
from the Massachusetts Institute of Technology. He has held appointments
at UC Berkeley, the Weizmann Institute of Science, the Georgia Institute
of Technology, and the Mathematical Sciences Research Institute. Since
2000 he has been on the faculty of the California Institute of
Technology. He has received the MIT Bucsela prize in mathematics, an NSF
mathematical sciences postdoctoral fellowship, an NSF CAREER award, an
Okawa Foundation grant, and the IEEE Schelkunoff prize. He is the
director of the Center for the Mathematics of Information and is on the
faculty of the Institute for Quantum Information. His research is in
several overlapping areas: algorithms and communication protocols;
combinatorics and probability; coding and information theory; quantum
computation. |
| |
|
|