Unbiased Entropy Estimator for Binary Sequences
https://doi.org/10.18255/1818-1015-2013-1-107-115
Abstract
A new class of metrics on a space of right-sided infinite sequences drawn from a binary alphabet was introduced.
About the Author
E. A. Timofeev
P.G. Demidov Yaroslavl State University
Russian Federation
Russian Federation
д-р физ.-мат. наук, профессор кафедры теоретической информатики,
Sovetskaya str., 14, Yaroslavl, 150000, Russia
References
1. Deza M., Deza T. Encyclopedia of Distances. Springer, 2009.
2. Grassberger P. Estimating the information content of symbol sequences and efficient codes // IEEE Trans. Inform. Theory. 1989. V. 35. P. 669–675.
3. Kaltchenko A., Timofeeva N. Entropy Estimators with Almost Sure Convergence and an O(n¯с) Variance // Advances in Mathematics of Communications. 2008. V. 2, №1. P. 1–13.
4. Kaltchenko A., Timofeeva N., Rate of convergence of the nearest neighbor entropy estimator // AEU – International Journal of Electronics and Communications. 2010. 64, №1. P. 75–79.
5. Timofeev E.A. Statistical Estimation of measure invariants // St. Petersburg Math. J. 2006. 17, №3. P. 527–551.
6. Timofeev E.A. Bias of a nonparametric entropy estimator for Markov measures // Journal of Mathematical Sciences. 2011. 176, №2. P. 255–269.
Review
For citations:
Timofeev E.A. Unbiased Entropy Estimator for Binary Sequences. Modeling and Analysis of Information Systems. 2013;20(1):107-115. (In Russ.) https://doi.org/10.18255/1818-1015-2013-1-107-115
Views:
854
Email this article 