Shannon's Theorems for a Complete Class of Discrete Memoryless Channels Whose State is Known at the Output

Coding theorems and their weak converse are proved for a complete class of discrete memoryless channels for ordinary and randomized codes with mean error, and also for randomized codes with maximum error under the assumption that the channel state is known at the output.