论文信息 - Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression - 字舞流文

Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression

Theorems concerning the entropy of a stationary ergodic information source are derived and used to obtain insight into the workings of certain data-compression coding schemes, in particular the Lempel-Siv data compression algorithm. >

Aaron D. Wyner | Jacob Ziv | A. Wyner | J. Ziv

[1] M. Kac. On the notion of recurrence in discrete stochastic processes , 1947 .

[2] Frans M. J. Willems,et al. Universal data compression and repetition times , 1989, IEEE Trans. Inf. Theory.

[3] L. Breiman. Correction Notes: Correction to "The Individual Ergodic Theorem of Information Theory" , 1960 .

[4] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[5] Michael Rodeh,et al. Linear Algorithm for Data Compression via String Matching , 1981, JACM.

[6] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[7] L. Breiman. The Individual Ergodic Theorem of Information Theory , 1957 .