06.13 | Progress in Error-Correction: A Survey
报告人: Venkatesan Guruswami
correcting codes play a crucial role in safeguarding data against the adverse effects of noise during communication and storage. They are also powerful tools that in theoretical computer science and combinatorics. The central challenge in coding theory is to construct codes with minimum possible redundancy for different error models and requirements on the decoder, along with efficient algorithms for error-correction using those codes. Much progress has been made toward this quest since the birth of coding theory almost 7 decades ago. Several fundamental problems, however, are still outstanding, and exciting new directions continue to emerge to address both current technological demands as well as connections to computational complexity and cryptography.
This talk will survey some of our recent works on error-correction in various models.
Venkatesan Guruswami received his Ph.D.in Computer Science from the Massachusetts Institute of Technology in 2001. He was then a Miller Research Fellow at UC Berkeley during 2001-02. Since 2008, Dr. Guruswami has been at Carnegie Mellon University where he is currently a Professor in the Computer Science Department.聽聽
Prof.Guruswami's research interests span several areas including coding theory, approximate optimization, and computational complexity theory. He serves as the Editor-in-Chief of the ACM Transactions on Computation Theory, and on the editorial boards of the Journal of the ACM, SIAM Journal on Computing. Prof.Guruswami served as the program committee chair for the 2015 IEEE Symposium on Foundations of Computer Science (FOCS).His earlier honors include the Packard and Sloan Fellowships (2005), NSF Career award (2004), the ACM Doctoral Dissertation Award (2002), and the IEEE Information Theory Society Paper Award (2000).