Optimal prefix codes and huffman codes

International Journal of Computer Mathematics

Volumn 80, Issue 6, 2003, Pages 727-742

  Long, Dongyang ^a,b   Jia, Weijia ^c   Li, Ming ^d  

^a SUN YAT SEN UNIVERSITY   (China)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Data transmission and compression; Huffman code; Maximal prefix code; Optimal prefix code

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION EQUIPMENT; DATA COMPRESSION; MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; STATISTICAL METHODS;

DATA TRANSMISSION AND COMPRESSION; HUFFMAN CODES; MAXIMAL PREFIX CODES; OPTIMAL PREFIX CODES;

CODES (SYMBOLS);

EID: 28244469542     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/0020716031000087140     Document Type: Article

References (23)

1. Abrahams, J. (1994). Huffman-type codes for infinite source distributions. J. Franklin Inst., 331B(3), 265-271.
2. Berstel, J. and Perrin, D. (1985). Theory of Codes. Academic Press, Orlando.
3. Bell, T. C., Cleary, J. G. and Witten, I. H. (1990). Text Compression. Prentice Hall, Englewood Cliffs, NJ.
4. Cover, T. and Thomas, J. (1991). Elements of Information Theory. New York, Wiley.
5. Fraenkel, A. S. and Klein, S. T. (1994). Complexity aspects of guessing prefix codes. Algorithmica, 409-419.
6. Gallager, R. A. and Van Voorhis, D. C. (1975). Optimal source coding for geometrically distributed integer alphabets. IEEE Trans. Inform. Theory, IT-21(3), 228-230.
7. Gillman, D. W., Mohtashemi, M. and Rivest, R. L. (1996). On breaking a Huffman code. IEEE Trans. Inform. Theory, IT-42(3), 972-976.
8. Huffman, D. A. (1951). A method for the construction of minimum redundancy codes. Proc. IRE, 40, 1098-1101.
9. Hankerson, D., Harris, G. A., Johnson, P. D., Jr. (1997). Introduction to Information Theory and Data Compression. CRC Press LLC.
10. Jürgensen, H. and Konstantinidis, S. (1997). Codes. In: Rozenberg, G. and Salomaa, A. (Eds.), Handbook of Formal Languages, Vol. 1, Springer-Verlag, Berlin, Heidelberg, pp. 511-607.
11. Jones, D. W. (1988). Applications of splay trees to data compression. Communication of ACM, 31, 996-1007.
12. Klein, S. T., Bookstein, A. and Deerwester, S. (1989). Storing text-retrieval systems on CD-ROM: Compression and encryption considerations. ACM Trans. Inform. Syst., 7, 230-245.
13. Lei, S. M. and Sun, M. T. (1991). An entropy coding system for digital HDTV applications. IEEE Trans. Circuit Systems Video Technology, 1, 147-155.
14. Linder, T., Tarokh, V. and Zeger, K. (1997). Existence of optimal prefix codes for infinite source alphabets. IEEE Trans. Inform. Theory, 43(6), 2026-2028.
15. Long, D. and Jia, W. (2001). Optimal maximal encoding different from Huffman encoding. Proc. of International Conference on Information Technology: Coding and Computing, 2-4 April 2001, Las Vegas, IEEE Computer Society, pp. 493-497.
16. Long, D. and Jia, W. (2000). The optimal encoding schemes. Proceedings of 16th World Computer Congress. 21-25 Aug 2000, Beijing, China, IFIP/SEC2000: Information Security, International Academic Publishers, pp. 25-28.
17. Montgomery, B. and Abrahams, J. (1987). On the redundancy of optimal binary prefix condition codes for finite and infinite sources. IEEE Trans. Inform. Theory, IT-3(1), 156-160.
18. Pennebaker, W. B. and Mitchell, J. L. (1993). JPEG; Still Image Data Compression Standard, New York.
19. Roman, S. (1996). Introduction to Coding and Information Theory. Springer-Verlag, New York.
20. Rubin, F. (1979). Cryptographic aspects of data compression codes. Cryptologia, 3, 202-205.
21. Salomon, D. (1988). Data Compression: The Complete Reference, Springer.
22. Vitter, J. S. (1987). Design and analysis of dynamic Huffman codes. Journal of the Association for Computing Machinery, 34(4), 825-845.
23. Shyr, H. J. (1991). Free Monoids and Languages. Hon Min Book Company, Taichung, Taiwan R.O.C.