Output Statistics of Random Binning for Multiple Access Channels and Strong Secrecy

Abstract

We consider utilizing the novel framework of output statistics of random binning, for proving achievability for communication over a multiple access channel. This framework uses the random binning technique while relying on the duality between channel and source coding problems. In particular, we provide the achievable rate region through a series of probability mass functions approximation arguments and consider randomness as an explicit random variable. Moreover, we analyze the wiretap version of the multiple access channel and prove that the strong secrecy criterion can be satisfied and an operational coding scheme can be designed by relying on the output statistics.