Random Coding Bounds for Discrete Memoryless Channels

The article describes a new method of constructing random coding bounds in a discrete memoryless channel for an ensemble of codes with fixed composition and for an ensemble generated by an independent distribution at the channel input. This method makes it possible to construct upper bounds for different ensembles in unified fashion, and establishes a natural relationship between different points of representation of random coding bounds.