Elements of information theory
Elements of information theory
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Simulation of random processes and rate-distortion theory
IEEE Transactions on Information Theory
Source codes as random number generators
IEEE Transactions on Information Theory
Source code with cost as a nonuniform random number generator
IEEE Transactions on Information Theory
Separation of random number generation and resolvability
IEEE Transactions on Information Theory
Folklore in source coding: information-spectrum approach
IEEE Transactions on Information Theory
Generating random bits from an arbitrary source: fundamental limits
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Necessary and sufficient conditions for approximation of a general channel by a general source are proved. For the special case in which the channel input is deterministic, which corresponds to source simulation, we prove a stronger necessary condition. As the approximation criteria, vanishing variational distance between the original and the approximated quantity is used for both of the problems. Both necessary and sufficient conditions for the two problems are based on some individual properties of the sources and the channel and are relatively easy to evaluate. In particular, unlike prior results for this problem, our results do not require solving an optimization problem to test simulatability.