COMPLEXITY OF FINITE SEQUENCES

被引：1900

作者：

LEMPEL, A

ZIV, J

机构：

[1] SPERRY RAND RES CTR,SUDBURY,MA

[2] BELL TEL LABS INC,MURRAY HILL,NJ

来源：

关键词：

D O I：

10.1109/TIT.1976.1055501

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：75 / 81

页数：7

共 8 条

[1]

CHAITIN G, 1974, RC4805 IBM REP

[2] INFORMATION-THEORETIC LIMITATIONS OF FORMAL SYSTEMS [J].

CHAITIN, GJ .

[3]

GALLAGER RG, 1968, INFORMATION THEORY R

[4]

Golomb S.W., 1967, SHIFT REGISTER SEQUE

[5] 3 APPROACHES TO QUANTITATIVE DEFINITION OF INFORMATION [J].

KOLMOGOROV, AN .

[6] DEFINITION OF RANDOM SEQUENCES [J].

MARTINLOF, P .

INFORMATION AND CONTROL, 1966, 9 (06) :602-+

[7] COMPLEXITY OSCILLATIONS IN INFINITE BINARY SEQUENCES [J].

MARTINLOF, P .

ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1971, 19 (03) :225-+

[8]

Schnorr C. P., 1973, Journal of Computer and System Sciences, V7, P376, DOI 10.1016/S0022-0000(73)80030-3