论文信息 - AN ENTROPY ESTIMATOR FOR A CLASS OF INFINITE ALPHABET PROCESSES

AN ENTROPY ESTIMATOR FOR A CLASS OF INFINITE ALPHABET PROCESSES

Motivated by recent work by Kontoyiannis and Suhov, and by Shields, we present an entropy estimator which works for a class of ergodic finite entropy infinite symbol processes for which the entropy of the time-zero partition is finite, and which satisfy a "Doeblin condition." The results are then extended to random fields indexed by $\bZ^d$.

Anthony Quas | A. Quas

[1] C. Caramanis. What is ergodic theory , 1963 .

[2] Peter Lancaster,et al. The theory of matrices , 1969 .

[3] Peter Walters,et al. Ruelle’s operator theorem and $g$-measures , 1975 .

[4] D. Ornstein,et al. The Shannon-McMillan-Breiman theorem for a class of amenable groups , 1983 .

[5] F. R. Gantmakher. The Theory of Matrices , 1984 .

[6] Michael S. Waterman,et al. An Erdös-Rényi law with shifts , 1985 .

[7] Peter Grassberger,et al. Estimating the information content of symbol sequences and efficient codes , 1989, IEEE Trans. Inf. Theory.

[8] Benjamin Weiss,et al. How Sampling Reveals a Process , 1990 .

[9] P. Baldwin. A multidimensional continued fraction and some of its statistical properties , 1992 .

[10] String Matching: The Ergodic Case , 1992 .

[11] P. Shields. Entropy and Prefixes , 1992 .

[12] Benjamin Weiss,et al. Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.

[13] Ioannis Kontoyiannis,et al. Prefixes and the entropy rate for long-range sources , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[14] P. Shields. String matching bounds via coding , 1997 .