On bounds for E-cainacity of DMC

被引：8
作者：
Haroutunian, Evgueni A. [1 ]
机构：
[1] Armenian Natl Acad Sci, Inst Informat & Automat Problems, Yerevan 0014, Armenia
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2007年 / 53卷 / 11期
关键词：
capacity; decoding rules; E-capacity; error probability bounds; method of graph decomposition; method of types; minimum-divergence decoding; rate-reliability function;
D O I：
10.1109/TIT.2007.907506
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：4210 / 4220
页数：11
相关论文
共 23 条
[1]  
[Anonymous], 1971, RATE DISTORTION THEO
[2]  
[Anonymous], 1962, TEOR VEROYATN PRIMEN
[3]  
Blahut R.E., 1987, Principles and Practice of Information Theory
[4]   HYPOTHESIS TESTING AND INFORMATION-THEORY [J].
BLAHUT, RE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (04) :405-417
[5]   General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds [J].
Chen, PN .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (01) :316-323
[6]   GRAPH DECOMPOSITION - A NEW KEY TO CODING THEOREMS [J].
CSISZAR, I ;
KORNER, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (01) :5-12
[7]  
Csiszar I., 1981, INFORM THEORY CODING
[8]  
D'yachkov A. G., 1980, PROBL PEREDACHI INF, V16, P3
[9]  
Fano R. M., 1961, Transmission of information
[10]  
a statistical theory of communications
123