Finding the fundamental limits of information systems: A computational approach
By Chao Tian
Traditionally, information theoretic limits of information systems are identified and proved analytically. As such systems become more sophisticated, such an approach becomes rather unwieldy. In this talk, we describe our recent effort in applying a computational approach to accomplish task. Particularly, we will provide results we obtained using this approach on exact-repair regenerating codes, multilevel diversity coding and caching problems, and also discuss in some depth the techniques used and the remaining challenges.