Speaker
Jaikumar Radhakrishnan (Tata Institute of Fundamental Research, Mumbai )
Date & Time
Mon, 02 April 2018, 15:00 to 16:00
Venue
Madhava Lecture Hall, ICTS Campus, Bangalore
Resources
Abstract
We will derive Hansel's inequality about graph covering using probabilistic and information-theoretic arguments. Based on this inequality, we will show bounds on the rate at which one can communicate across certain channels when no error is allowed. We will derive everything from scratch. (The talk will be based on joint work with Siddharth Bhandari, Marco Dalai and Venkat Guruswami.)