On weak convergence of probability measures and channel capacity with applications to code division spread-spectrum systems

For channels with finite input alphabet and general output alphabet the relationship between weak convergence of the probability measures at the output, given the input, and capacity and error bound, is examined. As an example showing the practical relevance of the work a code division multiple-access spread-spectrum system is being considered.<>