Combinatorial Reasoning in Information Theory

2009 ISIT Plenary Lecture
Combinatorial Reasoning in Information Theory
Professor Noga Alon
Tel Aviv University


 Combinatorial arguments have played a crucial role in the investigation of several surprising phenomena in Information Theory. I will discuss some of these results focusing on a recent example, based on joint papers with Lubetzky and Stav, and with Hassidim and Weinstein, in which properties of graph powers, colorings of Cayley graphs, and the chromatic numbers of Kneser graphs are applied in the study of a broadcasting problem with side information.


Noga Alon is a Baumritter Professor of Mathematics and Computer Science in Tel Aviv University, Israel. He received his Ph. D. in Mathematics at the Hebrew University of Jerusalem in 1983 and had visiting positions in various research institutes including MIT, The Institute for Advanced Study in Princeton, IBM Almaden Research Center, Bell Laboratories, Bellcore and Microsoft Research.
He serves on the editorial boards of more than a dozen international technical journals and has given invited lectures in many conferences, including plenary addresses in the 1996 European Congress of Mathematics and in the 2002 International Congress of Mathematician. He published more than four hundred research papers, mostly in Combinatorics and in Theoretical Computer Science, and one book.

He is a member of the Israel National Academy of Sciences since 1997 and of the Academia Europaea since 2008, and received the Erdos prize in 1989, the Feher prize in 1991, the Polya Prize in 2000, the Bruno Memorial Award in 2001, the Landau Prize in 2005, the Godel Prize in 2005 and the Israel Prize in 2008.


ISIT Plenary Lecture