May 18, 2016, Sidharth Jaggi, Chinese University, Hong Kong

Wednesday, May 18, 2016, 3-4 pm
15 St. Mary’s Street, Room 105
Refreshments at 2:45 pm

jaggi

Sidharth Jaggi
Chinese University, Hong Kong

 

 

Between Shannon and Hamming: Codes Against Causal Adversaries 

An adversary wishes to corrupt stored (or transmitted) data, but operates in an information-limited manner. Some examples of such limitations are when the adversary can only see some noisy version of Alice’s transmission, or can only view those transmissions causally. We determine the capacity of some classes of such channels, and computationally efficient schemes achieving these capacities in some models (in particular over “large alphabets”). This is an overview of a long line of classical results, and also work done over the last few years (with an emphasis on a flurry of recent results) in collaboration Bikash Kumar Dey, Anand Dilip Sarwate, Michael Langberg, Zitan Chen, Mayank Bakshi, Qiaosheng Zhang (Eric), Alex Sprintson, and Swanand Kadhe.

Sidharth Jaggi: Research interests: Network coding and network error-correcting algorithms, coding theory, steganography, group testing, compressive sensing.B.Tech. (’00), EE, IIT Bombay, MS/Ph.D. (’05) EE, CalTech, Postdoctoral Associate (’06) LIDS, MIT, Currently Associate Professor, Dept. of Information Engineering, The Chinese University of Hong Kong.

Faculty Host: Bobak Nazer