On Bounds for E-Capacity of DMC.

In this paper, we survey the concept of the E-capacity as a generalization to the Shannon's capacity of a channel and as an counterpart to the Shannon's reliability function. Random coding, expurgated and sphere packing bounds are derived by the method of types and by the method of graph decomposition for E-capacity of discrete memoryless channel (DMC). Three decoding rules are considered. This paper summarizes and revises the results of previous hardly accessible publications of the author. [ABSTRACT FROM AUTHOR]