GRAPH DECOMPOSITION - A NEW KEY TO CODING THEOREMS

被引:135
作者
CSISZAR, I
KORNER, J
机构
关键词
D O I
10.1109/TIT.1981.1056281
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:5 / 12
页数:8
相关论文
共 18 条
[1]  
Arutjunjan E. A., 1968, PROBL PEREDACHI INF, V4, P37
[2]   COMPOSITION BOUNDS FOR CHANNEL BLOCK CODES [J].
BLAHUT, RE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (06) :656-674
[3]   HYPOTHESIS TESTING AND INFORMATION-THEORY [J].
BLAHUT, RE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (04) :405-417
[4]   TOWARDS A GENERAL-THEORY OF SOURCE NETWORKS [J].
CSISZAR, I ;
KORNER, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (02) :155-165
[5]  
CSISZAR I, UNPUBLISHED
[6]  
CSISZAR I, 1977, OCT IEEE INT S INF T
[7]   RELIABILITY FUNCTION OF A DISCRETE MEMORYLESS CHANNEL AT RATES ABOVE CAPACITY [J].
DUECK, G ;
KORNER, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) :82-85
[8]  
FANO RM, 1961, TRANSMISSION INFORMA
[9]   A SIMPLE DERIVATION OF THE CODING THEOREM AND SOME APPLICATIONS [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (01) :3-18
[10]  
GALLAGER RG, 1976, JUL IEEE INT S INF T