A SOURCE MATCHING APPROACH TO FINDING MINIMAX CODES

被引:74
作者
DAVISSON, LD [1 ]
LEONGARCIA, A [1 ]
机构
[1] UNIV TORONTO,DEPT ELECT ENGN,TORONTO M5S 1A4,ONTARIO,CANADA
关键词
D O I
10.1109/TIT.1980.1056167
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:166 / 174
页数:9
相关论文
共 12 条
[1]   COMPUTATION OF CHANNEL CAPACITY AND RATE-DISTORTION FUNCTIONS [J].
BLAHUT, RE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (04) :460-+
[2]  
COVER TM, 1973, IEEE T INFORM THEORY, V19, P73, DOI 10.1109/TIT.1973.1054929
[3]   UNIVERSAL NOISELESS CODING [J].
DAVISSON, LD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (06) :783-795
[4]  
DAVISSON LD, 1966, P IEEE, V54
[5]  
GALLAGER RG, 1968, INFORMATION THEORY R
[6]  
GALLAGER RG, UNPUBLISHED
[7]  
LYNCH TJ, 1966, P IEEE, V34, P1490
[8]   RANDOM CODING STRATEGIES FOR MINIMUM ENTROPY [J].
POSNER, EC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :388-391
[9]   MINIMAX CODES FOR FINITE ALPHABETS [J].
RISSANEN, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (03) :389-392
[10]   ALGORITHM FOR SOURCE CODING [J].
SCHALKWIJK, JP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (03) :395-+