Ergodic behavior of graph entropy

Electronic Research Announcements of the American Mathematical Society

Volumn 3, Issue 2, 1997, Pages 11-16

  Kieffer, John ^a   Yang, En Hui ^b  

^a University of Minnesota   (United States)

^b NANKAI UNIVERSITY   (China)

Author keywords

Compression; Entropy; Graphs; Stationary ergodic process

Indexed keywords

EID: 85009776724     PISSN: None     EISSN: 10796762     Source Type: Journal    
DOI: 10.1090/S1079-6762-97-00018-8     Document Type: Article

References (5)

1. T. M. Cover and J. A. Thomas, Elements of information theory, Wiley, New York, 1991. MR 92g:94001
2. J. Kieffer and E.-H. Yang, "A complexity reduction method for lossless source code design," Technical Report, Dept. of Electrical Engineering, University of Minnesota Twin Cities, 1995 (http://www.ee.umn.edu/users/kieffer).
3. J. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman, "Lossless compression via bisection trees," Technical Report, Dept. of Electrical Engineering, University of Minnesota Twin Cities, 1996 (http://www.ee.umn.edu/users/kieffer).
4. J. Kieffer, G. Nelson, and E.-H. Yang, "Tutorial on the quadrisection method for lossless data compression," Technical Report, Dept. of Electrical Engineering, University of Minnesota Twin Cities, 1996 (http://www.ee.umn.edu/users/kieffer).
5. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. Inform. Theory, 22 (1976), 75-81. MR 52:10234