Technical Program

Paper Detail

Paper IDS.7.2
Paper Title Gray-Wyner and Slepian-Wolf Guessing
Authors Robert Graczyk, Amos Lapidoth, ETH Zurich, Switzerland
Session S.7: Guessing
Presentation Lecture
Track Shannon Theory
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract We study the guessing variants of two distributed source coding problems: the Gray-Wyner network and the Slepian-Wolf network. Building on the former, we propose a new definition of the Rényi common information as the least attainable common rate in the Gray-Wyner guessing problem under the no-excess-rate constraint. We then provide a variational characterization of this quantity. In the Slepian-Wolf setting, we follow up the work of Bracher-Lapidoth-Pfister with the case where the expected number of guesses need not converge to one but must be dominated by some given exponential.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!