Robust coding for uncertain sources: A minimax approach

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1539-1543

  Rezaei, Farzad ^a   Charalambous, Charalambos D ^a,b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

HUFFMAN CODING; NOMINAL DISTRIBUTIONS; SHANNON CODING;

COMPUTER SIMULATION; DECODING; ENTROPY; NUMERICAL METHODS; PROBLEM SOLVING;

ENCODING (SYMBOLS);

EID: 33749427185     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523602     Document Type: Conference Paper

References (19)

1. T. Cover and J. Thomas, Elements of Information Theory. John Wiley & Sons, 1991.
2. R. E. Blahut, Principles and Practice of Information Theory. Addison-Wesley, 1987.
3. C. Charalambous and J. Hibey, "Minimum principle for partially observable nonlinear risk-sensitive control problems using measure-valued decompositions," Stochastics and Stochastics Reports, vol. 57, pp. 247-288, 1996.
4. C. Charalambous, "The role of information state and adjoint in relating nonlinear output feedback risk-sensitive control and dynamic games," IEEE Transactions on Automatic Control, vol. 42, pp. 1163-1170, 1997.
5. L. Davisson, "Universal noiseless coding," IEEE Transactions on Information Theory, vol. 19, pp. 783-795, 1973.
6. L. Davisson and A. Leon-Garcia, "A source matching approach to finding minimax codes," IEEE Transactions on Information Theory, vol. 26, pp. 166-174, 1980.
7. L. Davisson, R. McEliece, M. Pursely and M. Wallace, "Efficient Universal Noiseless Source Codes" IEEE Transactions on Information Theory, vol. 27, pp. 269-279, 1981.
8. P.A. Humblet, "Generalization of Huffman coding to minimize the probability of buffer overflow" IEEE Transactions on Information Theory, vol. 27, pp. 230-237, 1981.
9. J. Rissanen, "Universal coding, information, prediction, and estimation" IEEE Transactions on Information Theory, vol. 30, pp. 629-636, 1984.
10. N. Merhav, "Universal Coding with Minimum Probability of Codeword Length Overflow" IEEE Transactions on Information Theory, vol. 37, pp. 556-563, 1991.
11. A.R. Barron, L. Györfi, E.C. van der Meulen, "Distribution Estimation Consistent in Total Variation and in two Types of Information Divergence" IEEE Transactions on Information Theory, vol. 38, pp. 1437-1454, 1992.
12. A.R. Barron, J. Rissanen, B. Yu, "The Minimum Description Length Principle in Coding and Modeling" IEEE Transactions on Information Theory, vol. 44, pp. 2743-2760, 1998.
13. I. Csiszar, "The method of Types" IEEE Transactions on Information Theory, vol. 44, pp. 2505-2523, 1998.
14. M. Drmota, W. Szpankowski, "Precise Minimax Redundancy and Regret" IEEE Transactions on Information Theory, vol. 50, pp. 2686-2707, 2004.
15. P. Jacquet, W. Szpankowski, "Markov Types and Minimax Redundancy for Markov Sources" IEEE Transactions on Information Theory, vol. 50, pp. 1393-1402, 2004.
16. A. A. Fedotov, P. Harremoës and F. Topsoe, "Refinements of Pinsker's Inequality" IEEE Transactions on Information Theory, vol. 49, pp. 1491-1498, 2003
17. J. Deuschel and D. Stroock, Large Deviations. Academic Press, 1989.
18. L. M. P.D. Pra and W. Runggaldier, "Some connections between stochastic control and dynamic games," Mathematics of Control, Signals, and Systems, vol. 9, pp. 303-326, 1996.
19. F. Rezaei and C.D. Charalambous, "Robust Coding for Uncertain Sources," submitted to IEEE Transactions on Information Theory, 2003