On Bounds for E-Capacity of DMC

Authors:
E. A. Haroutunian
Affiliations:
Inst. for Inf. & Autom. Problems of the Armenian Nat. Acad. of Sci., Yerevan
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 2

Reliability criteria in information theory and in statistical hypothesis testing

Foundations and Trends in Communications and Information Theory
Multiple objects: error exponents in hypotheses testing and identification

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

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.