CODING THEOREMS FOR INDIVIDUAL SEQUENCES

被引:109
作者
ZIV, J
机构
关键词
D O I
10.1109/TIT.1978.1055911
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:405 / 412
页数:8
相关论文
共 12 条
[1]   THEORY OF PROGRAM SIZE FORMALLY IDENTICAL TO INFORMATION-THEORY [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1975, 22 (03) :329-340
[2]  
GALLAGER RG, 1968, INFORMATION THEORY R
[3]   SLIDING-BLOCK SOURCE CODING [J].
GRAY, RM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :357-368
[4]   ERGODIC DECOMPOSITION OF STATIONARY DISCRETE RANDOM PROCESSES [J].
GRAY, RM ;
DAVISSON, LD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) :625-636
[5]  
GRAY RM, 1975, IEEE T INFORM THEORY, V21, P524, DOI 10.1109/TIT.1975.1055440
[6]   COMPLEXITY OF FINITE SEQUENCES [J].
LEMPEL, A ;
ZIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (01) :75-81
[7]   DEFINITION OF RANDOM SEQUENCES [J].
MARTINLOF, P .
INFORMATION AND CONTROL, 1966, 9 (06) :602-+
[8]  
RODEH M, 1976, THESIS TECHNION
[9]  
SHPERLING I, 1976, THESIS TECHNION
[10]  
WINKELBAUER K, 1964, 3RD T PRAG C INF THE, P765