Technical Program

Paper Detail

Paper IDP.7.1
Paper Title Resolvability of the Multiple Access Channel with Two-Sided Cooperation
Authors Noha Helal, The University of Texas at Dallas, United States; Matthieu Bloch, Georgia Institute of Technology, United States; Aria Nosratinia, The University of Texas at Dallas, United States
Session P.7: Information Theoretic Security III
Presentation Lecture
Track Cryptography, Security and Privacy
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract We study the randomness required at the inputs of a multiple access channel in order to produce a desired, approximately i.i.d., output distribution, subject to cooperation in one of the following forms: (i) a common message, (ii) conferencing, (iii) feedback and (iv) generalized feedback. For the cases (i)-(iii), we characterize the channel resolvability via matching inner and outer bounds, and for generalized feedback we provide two inner bounds representing the role of decoding and randomness extraction, which can also be combined. One of the main contributions of this work is to show that resolvability rates of the multiple access channel are not improved with feedback, unlike the multiple access channel capacity which {\em is} improved by feedback.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!