Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions
Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions
The capacity of a channel can usually be characterized as a maximization of certain entropic quantities. From a practical point of view it is of primary interest to not only compute the capacity value, but also to find the corresponding optimizer, i.e., the capacity-achieving input distribution. This paper addresses the …