Imperial College London > Talks@ee.imperial > COMMSP Seminar > Function Structures and Distributed Computing

Function Structures and Distributed Computing

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Cong Ling.

We consider a distributed coding problem for function computation in which correlated multiple sources are separately encoded and the central decoder seek to reproduce function value of the sources. This problem has been actively studied in information theory, but it has been a long standing open problem. In this talk, we will review some of key results on this problem, such as Korner and Marton’s modulo-sum coding, Ahlswede and Csiszar’s one-bit theorem, and Han and Kobayashi’s dichotomy theorem. Then, we will present some recent progress and open problems. In particular, we will discuss how function structures affect the optimal rate region of distributed computing system.

Bio: Shun Watanabe received B.E., M.E., and Ph.D. degree from Tokyo Institute of Technology in 2005, 2007, and 2009, respectively. During April 2009 to February 2015, he was an assistant professor of the Department of Information Science and Intelligence Systems at the University of Tokushima. During April 2013 to March 2015, he was a visiting assistant professor of the Institute for Systems Research at the University of Maryland, College Park. During March to April 2016, he was a visiting fellow at the Institute of Henri Poincare. Since February 2015, he has been an associate professor of the Department of Computer and Information Sciences at Tokyo University of Agriculture and Technology. He is a senior member of IEEE and a member of IEICE . He currently serves as an Associate Editor for the IEEE Transactions on Information Theory.

This talk is part of the COMMSP Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Changes to Talks@imperial | Privacy and Publicity