Event
Comm, Control, Sig Procss Seminar: Shun Watanabe, "Revisiting identification and common randomness"
Thursday, October 1, 2020
9:00 a.m.-10:30 a.m.
Zoom online meeting
Ajaykrishnan Nageswaran
301 405 3661
ajayk@umd.edu
http://www.ece.umd.edu/seminars/ccsp/
Communication, Control and Signal Processing Seminar
Revisiting the identification and common randomness
Shun Watanabe
Tokyo University of Agriculture and Technology
https://umd.zoom.us/j/94248911135<
Abstract
In this talk, we revisit the problem of identification via channel, introduced by Ahlswede and Dueck. In contrast to the standard channel coding problem in which exponentially many messages can be transmitted, doubly exponentially many messages can be identified in the identification problem. This is closely related to how much common randomness can be created. We will explain some basic constructions (achievability result) that connect the identification capacity and the common randomness capacity. Also, we will explain Han and Verdu’s method to prove the converse theorem of the identification capacity using the so-called channel resolvability. We will try to review the identification problem from the perspective of the information theory as well as theoretical computer science. If time permits, some open problems will be discussed, and I will also describe a recent observation regarding the identification capacity of general (possibly non-ergodic) channels.
A part of the talk is based on the following review paper
“Communication for generating correlation: A unifying survey,” TIT2020
(M. Sudan, H. Tyagi and S. Watanabe).