Approximating the output of the multiple access channel

This work studies the randomness needed for approximating the output distribution of a multiple access channel, where the original input processes are independent of each other. The approximation is achieved by simulating (possibly alternative) input processes at each of the entries, where the sources of randomness available for the simulators are independent of each other, and the simulators do not cooperate. The resolvability region of a multiple access channel is defined, and close relations between the concepts of resolvability region and capacity region are demonstrated.