A general framework for codes involving redundancy minimization

IEEE Transactions on Information Theory

Volumn 52, Issue 1, 2006, Pages 344-349

  Baer, Michael B ^a,b  

^a Stanford University   (United States)

^b Electronics for Imaging   (United States)

Author keywords

Huffman algorithm; Minimax redundancy; Optimal prefix code; R nyi entropy; Unification

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; REDUNDANCY;

HUFFMAN ALGORITHM; MINIMAX REDUNDANCY; OPTIMAL PREFIX CODE; UNIFICATION;

CODES (SYMBOLS);

EID: 33144466938     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.860469     Document Type: Article

References (24)

1. D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, no. 9, pp. 1098-1101, Sep. 1952.
2. B. McMillan, "Two inequalities implied by unique decipherability," IRE Trans. Inf. Theory, vol. IT-2, no. 4, pp. 115-116, Dec. 1956.
3. T. C. Hu, D. J. Kleitman, and J. K. Tamaki, "Binary trees optimum under various criteria," SIAM J. Appl. Math., vol. 37, no. 2, pp. 246-256, Apr. 1979.
4. D. S. Parker, Jr., "Conditions for optimality of the Huffman algorithm," SIAM J. Comput., vol. 9, no. 3, pp. 470-489, Aug. 1980.
5. D. E. Knuth, "Huffman's algorithm via algebra," J. Comb. Theory, Ser. A, vol. 32, pp. 216-224, 1982.
6. C. Chang and J. Thomas, "Huffman algebras for independent random variables," Discr. Event Dynamic Syst., vol. 4, no. 1, pp. 23-40, Feb. 1994.
7. L. L. Campbell, "Definition of entropy by means of a coding problem," Z. Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 6, pp. 113-118, 1966.
8. P. Nath, "On a coding theorem connected with Rényi entropy," Inf. Contr., vol. 29, no. 3, pp. 234-242, Nov. 1975.
9. M. Drmota and W. Szpankowski, "Precise minimax redundancy and regret," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2686-2707, Nov. 2004.
10. P. A. Humblet, "Generalization of Huffman coding to minimize the probability of buffero verflow," IEEE Trans. Inf. Theory, vol. IT-27, no. 2, pp. 230-232, Mar. 1981.
11. P. A. Humblet, "Source Coding for Communication Concentrators," Ph.D. dissertation, MIT, Cambridge, MA, 1978.
12. J. van Leeuwen, "On the construction of Huffman trees," in Proc. 3rd Int. Colloquium on Automata, Languages, and Programming, Univ. Edinburgh, Edinburgh, U.K., Jul. 1976, pp. 382-410.
13. E. S. Schwartz, "An optimum encoding with minimum longest code and total numberof digits," Inf. Contr., vol. 7, no. 1, pp. 37-44, Mar. 1964.
14. G. Markowsky, "Best Huffman trees," Acta Informatica, vol. 16, pp. 363-370, 1981.
15. Y. Horibe, "Remarks on 'compact' Huffman trees," J. Comb., Inf. Syst. Sci., vol. 9, no. 2, pp. 117-120, 1984.
16. G. Forst and A. Thorup, "Minimal Huffman trees," Acta Informatica, vol. 36, no. 9/10, pp. 721-734, Apr. 2000.
17. L. T. Kou, "Minimum variance Huffman codes," SIAM J. Comput., vol. 9, no. 1, pp. 138-148, Feb. 1982.
18. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, Jul. 1948.
19. M. Drmota and W. Szpankowski, "Generalized Shannon code minimizes the maximal redundancy," in Proc. Latin American Theoretical Informatics (LATIN) 2002. New York: Springer-Verlag, 2002, pp. 306-318.
20. M. Baer, "Coding for General Penalties," Ph.D. dissertation, Stanford Univ., Stanford, CA, 2003.
21. A. Rényi, "Some fundamental questions of information theory," Magyar Tudományos Akadémia III. Osztalyanak Közlemenei, vol. 10, no. 1, pp. 251-282, 1960.
22. G. Longo and G. Galasso, "An application of informational divergence to Huffman codes," IEEE Trans. Inf. Theory, vol. IT-28, no. 1, pp. 36-43, Jan. 1982.
23. A. C. Blumer and R. J. McEliece, "The Rényi redundancy of generalized Huffman codes," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1242-1249, Sep. 1988.
24. I. J. Taneja, "A short note on the redundancy of degree α," Inf. Sci., vol. 39, no. 2, pp. 211-216, Sep. 1986.