EE Systems Seminar

Abstract: 

The index coding problem, which lies at the intersection of many of the most fundamental problems in network information theory, has attracted much recent interest. In this talk, we will view the index coding problem as an interference management problem in wireless networks.

We will identify the simplest index coding instance where non-Shannon information inequalities are necessary. Notably, our approach is by hand, from scratch, while all previous work on the necessity of non-Shannon inequalities relies on Vamos matroid

or computer search. We will show coloring/interference avoidance/TDMA/orthogonal access is information theoretically optimal for index coding instances with convexly connected topologies. Convexly connected topology is motivated by wireless cellular networks, where cells are convex regions.

Biography:

Hua Sun received the B.E. degree in Communications Engineering from Beijing University of Posts and Telecommunications, Beijing, China, in 2011, the M.S. degree in Electrical and Computer Engineering from University of California Irvine, USA, in 2013. He is currently pursuing the Ph.D. degree at the University of California Irvine. His research interests include multiuser information theory and wireless communications.