Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel

Noha Helal, Matthieu Bloch, Aria Nosratinia

We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to a…