Generalized Shannon code minimizes the maximal redundancy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2286, Issue , 2002, Pages 306-318

  Drmota, Michael ^a   Szpankowski, Wojciech ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; ENCODING (SYMBOLS); FOURIER SERIES; MAXIMUM LIKELIHOOD; OPTIMIZATION; REDUNDANCY;

ANALYTIC ANALYSIS; AVERAGE CODE LENGTH; AVERAGE REDUNDANCIES; EFFICIENT IMPLEMENTATION; MAXIMUM LIKELIHOOD DISTRIBUTIONS; MEMORYLESS SOURCE; OPTIMIZATION CRITERIA; SOURCE DISTRIBUTION;

OPTIMAL SYSTEMS;

EID: 84888077574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_29     Document Type: Conference Paper

References (19)

1. J. Abrahams, "Code and Parse Trees for Lossless Source Encoding, Proc. of Compression and Complexity of SEQUENCE’97, Positano, IEEE Press, 145–171, 1998.
2. A. Barron, J. Rissanen, and B. Yu, The Minimum Description Length Principle in Coding and Modeling, IEEE Trans. Information Theory, 44, 2743-2760, 1998.
3. T. Cover and J.A. Thomas, Elements of Information Theory, John Wiley & Sons, New York 1991.
4. L. Campbell, A Coding Theorem and Rényi’s Entropy, Information and Control, 8, 423–429, 1965.
5. M. Drmota and R. Tichy, Sequences, Discrepancies, and Applications, Springer Verlag, Berlin Heidelberg, 1997.
6. D. E. Knuth, Dynamic Huffman Coding, J. Algorithms, 6, 163-180, 1985.
7. E. Krätzel, Lattice Points, Kluwer, Dordrecht, 1988.
8. P. Nath, On a Coding Theorem Connected with Rényi’s Entropy, Information and Control, 29, 234–242, 1975.
9. J. van Leeuwen, On the Construction of the Huffman Trees, Proc. ICALP’76, 382–410, 1976.
10. J. Rissanen, Complexity of Strings in the Class of MarkovSo urces, IEEE Trans. Information Theory, 30, 526–532, 1984.
11. J. Rissanen, Fisher Information and Stochastic Complexity, IEEE Trans. Information Theory, 42, 40–47, 1996.
12. P. Shields, Universal Redundancy Rates Do Not Exist, IEEE Trans. Information Theory, 39, 520-524, 1993.
13. D. S. Parker, Conditions for Optimiality of the Huffman Algorithm, SIAM J. Compt., 9, 470–489, 1980.
14. Y. Shtarkov, Universal Sequential Coding of Single Messages, Problems of Information Transmission, 23, 175–186, 1987.
15. W. Szpankowski, On Asymptotics of Certain Recurrences Arising in Universal Coding, Problems of Information Transmission, 34, No.2, 55-61, 1998.
16. W. Szpankowski, Asymptotic Redundancy of Huffman (and Other) Block Codes, IEEE Trans. Information Theory, 46, 2434-2443, 2000.
17. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 2001.
18. Q. Xie, A. Barron, Minimax Redundancy for the Class of Memoryless Sources, IEEE Trans. Information Theory, 43, 647-657, 1997.
19. Q. Xie, A. Barron, Asymptotic Minimax Regret for Data Compression, Gambling, and Prediction, IEEE Trans. Information Theory, 46, 431-445, 2000.