Error-correcting codes give a way to represent data to protect it from errors. I will describe recent results on both classical and modern themes in the theory of error-correcting codes, along with some applications to data storage, communication, cryptography and complexity.
Bio: Swastik Kopparty is an Associate Professor of Computer Science and Mathematics at Rutgers University in New Jersey. His research areas include error-correcting codes, computational complexity theory, finite fields, randomness and pseudorandomness. Prior to joining Rutgers, Swastik got his PhD in Computer Science from MIT in 2010, and was a postdoc at the School of Mathematics in the Institute for Advanced Study during 2010-2011. He is a recipient of the Alfred P. Sloan Research Fellowship and the NSF CAREER Award.