BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium : Progress in Error-Correction: New Codes for Old No
 ise Models
DTSTART:20161121T161500
DTEND:20161121T173000
DTSTAMP:20260407T163450Z
UID:762394c2065488a4d1795c4556c3216675943cb77f71a45cf4e6187b
CATEGORIES:Conferences - Seminars
DESCRIPTION:By : Venkat Guruswami - Carnegie Mellon University  \n\nVideo
  of his talk\n\nAbstract :\nError-correcting codes play a crucial role in 
 safeguarding data against the adverse effects of noise during communicatio
 n and storage. They are also powerful tools that underlie several advances
  in theoretical computer science. The central challenge in coding theory i
 s to construct codes with minimum possible redundancy for different noise 
 models and requirements on the decoder\, along with efficient algorithms f
 or error-correction using those codes. Much progress has been made toward 
 this quest in the nearly 70 years since the birth of coding theory. Severa
 l fundamental problems\, however\, continue to challenge us\, and exciting
  new questions routinely emerge to address the demands of modern technolog
 ies. This talk will survey some of our recent works on error-correction in
  various noise models\, such as:\n\n- worst-case errors\, where we constru
 ct list decodable codes with redundancy as small as the target error fract
 ion\; \n\n- i.i.d. errors\, where we show polar codes enable efficient er
 ror-correction even as the redundancy approaches Shannon capacity\;\n\n- b
 it deletions\, where we give codes that can correct the largest known frac
 tion of deletions\;\n\n- single symbol erasure\, a model of substantial cu
 rrent interest for tackling node failures in distributed storage\, where w
 e give novel repair algorithms for Reed-Solomon codes as well as simple ne
 w codes with low-bandwidth repair mechanisms.  \n\nBio :\nVenkatesan Guru
 swami (Venkat) received his Bachelor's degree from the Indian Institute of
  Technology at Madras in 1997 and his Ph.D. in Computer Science from the M
 assachusetts Institute of Technology in 2001. He was a Miller Research Fel
 low at UC Berkeley during 2001-02. Since 2008\, Venkat has been on the fac
 ulty at Carnegie Mellon University\, where he is currently a Professor in 
 the Computer Science Department. Earlier\, he was on the faculty at Univer
 sity of Washington\, and has held visiting positions at the Institute for 
 Advanced Study\, Princeton (2007-08) and Microsoft Research New England (2
 014).\n\nVenkat's research interests span several topics including coding 
 theory\, complexity of approximate optimization and constraint satisfactio
 n\, pseudorandomness\, and computational complexity. Venkat currently serv
 es on the editorial boards of the Journal of the ACM\, SIAM Journal on Com
 puting\, and Research in the Mathematical Sciences\; he was previously an 
 associate editor for the IEEE Transactions on Information Theory and ACM T
 ransactions on Computation Theory. Venkat served as the program committee 
 chair for the 2015 IEEE Symposium on Foundations of Computer Science (FOCS
 ) and 2012 IEEE Conference on Computational Complexity (CCC). He was an in
 vited speaker at the 2010 International Congress of Mathematicians. Venkat
  is a recipient of the EATCS Presburger Award\, Packard and Sloan Fellowsh
 ips\, the ACM Doctoral Dissertation Award\, and the IEEE Information Theor
 y Society Paper Award.  \n\nMore information
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR