Universal erasure entropy estimation

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 2358-2362

  Yu, Jiming ^a   Verdú, Sergio ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CTW BASED ALGORITHM; ENTROPY ESTIMATION; MARKOV SOURCES;

ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES;

TREES (MATHEMATICS);

EID: 39049149881     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.262010     Document Type: Conference Paper

References (16)

1. S. Verdú and T. Weissman, "Erasure entropy," in Proc. IEEE Int. Symp. Information Theory, Seattle, Washington, July 2006.
2. C. E. Shannon, "Prediction and entropy of printed English," Bell Syst. Techn. J., vol. 30, pp. 50-64, 1951.
3. T. M. Cover and R. C. King, "A convergent gambling estimate of the entropy of English," IEEE Trans. Inform. Theory, vol. 24, pp. 413-421, July 1978.
4. P. Grassberger, "Estimating the information content of symbol sequences and efficient codes," IEEE Trans. Inform. Theory, vol. 35, pp. 669-675, May 1989.
5. I. Kontoyiannis, P. H. Algoet, Y. M. Suhov, and A. J. Wyner, "Nonparametric entropy estimation for stationary processes and random fields, with applications to English text," IEEE Trans. Inform. Theory, vol. 44, pp. 1319-1327, May 1998.
6. H. Cai, S. R. Kulkami, and S. Verdú, "Universal entropy estimation via block sorting," IEEE Trans. Inform. Theory, vol. 50, pp. 1551-1561, July 2004.
7. H. Cai, S. R. Kulkami, and S. Verdú, "Universal divergence estimation for finite-alphabet sources," Submitted to IEEE Trans. on Inform. Theory, 2005.
8. H. Cai, S. R. Kulkami, and S. Verdú, "A universal lossless compressor with side information based on context tree weighting," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sept. 2005.
9. F. M. J. Willems, Y. M. Shtarkov, and T. J. Tjalkens, "The contexttree weighting method: Basic properties," IEEE Trans. Inform. Theory, vol. 41, pp. 653-664, May 1995.
10. F. M. J. Willems, "The context-tree weighting method: Extensions," IEEE Trans. Inform. Theory, vol. 44, pp. 792-798, Mar. 1998.
11. M. J. Weinberger, J. J. Rissanen, and M. Feder, "A universal finite memory source," IEEE Trans. Inform. Theory, vol. 41, pp. 643-652, May 1995.
12. T. Weissman, E. Ordentlich, G. Seroussi, S. Verdú, and M. Weinberger, "Universal discrete denoising: Known channel," IEEE Trans. Inform. Theory, vol. 51, pp. 5-28, Jan. 2005.
13. E. Ordentlich, M. J. Weinberger, and T. Weissman, "Multi-directional context sets with applications to universal denoising and compression," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sept. 2005.
14. J. Yu and S. Verdú, "Schemes for bi-directional modeling of discrete stationary sources," in Proc. 39th Annual Conference on Information Science and Systems, Baltimore, MD, Mar. 2005.
15. F. M. J. Willems and T. J. Tjalkens, "Complexity reduction of the context-tree weighting algorithm: A study for KPN research," EIDMA Report Series: EIDMA-RS. 97. 01, Euler Institute of Discrete Mathematics and its Applications, Jan. 1997.
16. P. Volf, Weighting Techniques in Data Compression: Theory and Algorithm. PhD thesis, Technisch Universiteit Eindhoven, 2002.