Tunstall adaptive coding and miscoding

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 2, 1996, Pages 2167-2180

  Fabris, Francesco ^a,b   Sgarro, Andrea ^c   Pauletti, Rudy ^d  

^a IEEE

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF TRIESTE   (Italy)

^d Pauletti Professional   (Italy)

Author keywords

Adaptive coding; Informational divergence; Self information; Source coding; Tunstall codes; Variable length to block coding

Indexed keywords

EID: 0003216056     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556605     Document Type: Article

References (18)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
2. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
3. F. Fabris, "The Longo-Galasso criterion for Huffman codes: an extended version," Alta Frequenza, vol. LVIII, no.1, pp. 35-38, Jan.-Feb. 1989.
4. F. Fabris and G. Della Riccia, "An application of the Hopfield model to Huffman codes," IEEE Trans. Inform. Theory, vol. 39, no. 3, pp. 1071-1076, May 1993.
5. R. Gallager, "Variations on a theme by Huffman," IEEE Trans. Inform. Theory, vol. IT-24, no. 6, pp. 668-674, Nov. 1978.
6. F. Jelinek and G. Longo, "Algorithms for source coding," in Coding and Complexity, G. Longo, Ed. New York:Springer-Verlag, 1976.
7. F. Jelinek and K. Schneider, "On variable length-to-block coding," IEEE Trans. Inform. Theory, vol. IT-18, no. 6, pp. 765-774, Nov. 1972.
8. R. E. Kricevskij, "The block-length necessary to obtain a given redundancy," Sov. Math. - Dokl., vol. 7, no. 6, pp. 1416-1420, 1966.
9. D. A. Lelewer and D. S. Hirschberg, "Data compression," ACM Comput. Surv., vol. 19, no. 3, pp. 261-294, Sept. 1987.
10. G. Longo and G. Galasso, "An application of informational divergence to Huffman codes," IEEE Trans. Inform. Theory, vol. IT-28, no. 1, pp. 36-43, Jan. 1982.
11. J. L. Massey, "The entropy of a rooted tree with probabilities," in Proc. 1983 Int. Symp. on Information Theory, St. Jovite, Canada.
12. T. Nemetz, "On the word-length of Huffman codes," Probl. Contr. and Inform. Theory, vol 9, pp. 231-242, 1980.
13. T. Nemetz and J. Simon, "Self information and optimal codes," in Proc. Colloq. on Information Theory (Keszthely, Hungary, Aug. 1975), pp. 457-468.
14. B. Nissenbaum and M. Feder, "An adaptive universal variable-to-fix lossless coding scheme," in Proc. 1994 Int. Symp. on Information Theory, p. 193.
15. H. N. Shapiro, Introduction to the Theory of Numbers. New York: Wiley, 1983.
16. T. J. Tjalkens and F. M. J. Willems, "Variable to fixed-length codes for Markov source," IEEE Trans. Inform. Theory, vol. IT-33, no. 2, pp. 246-257, May 1987.
17. _, "A universal variable-to-fixed length source code based on Lawrence's algorithm," IEEE Trans. Inform. Theory, vol. 38, no. 2, pp. 247-253, May 1992.
18. N. Wirth, Algorithms & Data Structures. Englewood Cliffs, NJ: Prentice Hall (int. edit.), 1986.