  We consider a generalization of the discrete memoryless channel, in which the
channel probability distribution is replaced by a uniform distribution over
clouds of channel output sequences. For a random ensemble of such channels, we
derive an achievable error exponent, as well as its converse together with the
optimal correct-decoding exponent, all as functions of information rate. As a
corollary of these results, we obtain the channel ensemble capacity.
