Video Lectures

Separate tags with a comma.
The study of random Cayley graphs of finite groups is related to the investigation of Expanders and to problems in Combinatorial Number Theory and in Information Theory. I will discuss this topic, describing the motivation and focusing on the...

Interactive Channel Capacity

Gillat Kol
In a profoundly influential 1948 paper, Claude Shannon defined the entropy function H, and showed that the capacity of a symmetric binary channel with noise rate (bit flip rate) eps is 1−H(eps). This means that one can reliably communicate n bits by...