Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression

IEEE Transactions on Information Theory

Volumn 35, Issue 6, 1989, Pages 1250-1258

  Wyner, Aaron D ^a   Ziv, Jacob ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC--ENCODING; PROBABILITY;

ENTROPY; LEMPEL-ZIV DATA COMPRESSION ALGORITHM; STATIONARY ERGODIC INFORMATION SOURCE;

INFORMATION THEORY;

EID: 0024768981     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.45281     Document Type: Article

References (8)

1. L. Breiman, “The individual ergodic theorem of information theory,” Ann. Math. Statist., vol. 28, pp. 809-811, 1957. (See also a correction to this paper in Ann. Math. Statist., vol. 31, pp. 809-810, 1960.
2. P. Elias, “Universal codeword sets and representations of the integers,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, 1975, theorem 4.
3. P. R. Halmos, Measure Theory. New York: Springer-Verlag, 1950, p. 125, theorem 13.
4. M. Kac, “On the notion of recurrence in discrete stochastic processes,” Bull. Amer. Math. Soc, vol. 53, pp. 1002-1010.
5. M. Rodeh, V. R. Pratt, and S. Even, “Linear algorithm for data compression via string matching,” J. Assoc. Comput. Mach., vol. 28, pp. 16-24, Jan. 1981, sect. 3.
6. F. M. J. Willems, “Universal data compression and repetition times,” IEEE Trans. Inform. Theory, to be published.
7. A. D. Wyner and J. Ziv, in preparation.
8. J. Ziv and A. Lempel, “Compression of individual sequence via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.