On Bounds for E-Capacity of DMC

Author

Haroutunian, Evgueni A.

Author_Institution

Inst. for Inf. & Autom. Problems of the Armenian Nat. Acad. of Sci., Yerevan

Volume

53

Issue

11

fYear

2007

Firstpage

4210

Lastpage

4220

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.

Keywords

channel capacity; channel coding; decoding; error statistics; graph theory; random codes; telecommunication channels; telecommunication network reliability; E-capacity; DMC; Shannon channel capacity; decoding rules; discrete memoryless channel; error probability; graph decomposition; random coding; rate-reliability function; sphere packing bounds; Associate members; Capacity planning; Channel capacity; Communication systems; Decoding; Error probability; Informatics; Memoryless systems; Rate-distortion; Stochastic processes; $E$-capacity; Capacity; decoding rules; error probability bounds; method of graph decomposition; method of types; minimum-divergence decoding; rate-reliability function;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2007.907506

Filename

4373407