LOWER BOUNDS TO ERROR PROBABILITY FOR CODING ON DISCRETE MEMORYLESS CHANNELS .2.

被引:146
作者
SHANNON, CE
GALLAGER, RG
BERLEKAM.ER
机构
来源
INFORMATION AND CONTROL | 1967年 / 10卷 / 05期
关键词
D O I
10.1016/S0019-9958(67)91200-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:522 / +
页数:1
相关论文
共 27 条
[1]  
ASH R, 1965, INFORMATION THEORY
[2]  
Berlekamp E. R., 1964, THESIS MIT
[3]  
Bhattacharyya A., 1943, BULL CALCUTTA MATH S, V35, P99
[4]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507
[5]  
DOBRUSHIN, 1962, THEORY PROBABILITY I, V7, P199
[6]  
ELIAS P, 1955, 335 MIT RES LAB EL T
[7]  
FANO RM, 1961, TRANSMISSION INFORMA
[8]   ERROR BOUNDS IN NOISY CHANNELS WITHOUT MEMORY [J].
FEINSTEIN, A .
IRE TRANSACTIONS ON INFORMATION THEORY, 1955, 1 (02) :13-14
[9]   Generalization of a probability limit theorem of Cramer [J].
Feller, W. .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1943, 54 (1-3) :361-372
[10]  
GALLAGER R, 1965, OPR77 MIT RES LAB EL, P277