On the Complexity of Finite Sequences

IEEE Transactions on Information Theory

Volumn 22, Issue 1, 1976, Pages 75-81

  Lempel, Abraham ^a   Ziv, Jacob ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE SEQUENCES;

INFORMATION THEORY;

EID: 0016880887     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1976.1055501     Document Type: Article

References (8)

1. A. N. Kolmogorov, “Three approaches to the quantitative definition of information,” Probl. lnform. Transmission, vol. 1, pp. 1–7, 1965.
2. P. Martin-Löf, “The definition of random sequences,” Inform. Contr., vol, 9, pp. 602–619. 1966.
3. P. Martin-Löf, “Complexity oscillations in infinite binary sequences,” Z. Wahrscheinlichkeit verw. Geb., vol. 19. PP. 225–230. 1971.
4. C. P. Schnorr, “The process complexity and effective random tests,” J. Comput. Syst, Sci., vol. 7, pp. 376–388. 1973.
5. G. Chaitin, “A theory of program size formally identical to information theory,” IBM, Yorktown Heights, N.Y., Rep. RC 4805, Apr. 1974.
6. G. Chaitin, “Information-theoretic limitations of formal systems,” J. Ass. Comput, Mach., vol. 21. no. 403–424. 1974.
7. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley. 1968.
8. S. W. Golomb, Shift Register Sequences. San Francisco: Holden. Day, 1967.