Resolvability theory for the multiple-access channel

1 March 1998

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 44 (2) , 472-487
https://doi.org/10.1109/18.661498

Abstract

We study 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 as the set of all random-bit rate pairs at which accurate output approximation is possible, where the simulation accuracy is measured by the variational distance between finite-dimensional output distributions. Inner and outer bounds on the resolvability region are derived, and close relations between the concepts of resolvability region and capacity region are demonstrated.

Keywords

This publication has 6 references indexed in Scilit:

Elements of Information Theory
Published by Wiley ,2001
Simulation of random processes and rate-distortion theory
IEEE Transactions on Information Theory, 1996
A general formula for channel capacity
IEEE Transactions on Information Theory, 1994
Channel simulation and coding with side information
IEEE Transactions on Information Theory, 1994
Approximation theory of output statistics
IEEE Transactions on Information Theory, 1993
Identification via channels
IEEE Transactions on Information Theory, 1989