On the implementation of minimum redundancy prefix codes

IEEE Transactions on Communications

Volumn 45, Issue 10, 1997, Pages 1200-1207

  Moffat, Alistair ^a   Turpin, Andrew ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Canonical code; Huffman code; Length limited code; Minimum redundancy code; Prefix code, text compression

Indexed keywords

HUFFMAN TREES;

DATA STRUCTURES; DECODING; ENCODING (SYMBOLS); FUNCTIONS; REDUNDANCY; TREES (MATHEMATICS);

DATA COMPRESSION;

EID: 0031259482     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.634683     Document Type: Article

References (24)

1. D.A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, Sept. 1952.
2. D.A. Lelewer and D. S. Hirschberg, "Data compression," Comput. Surveys, vol. 19, pp. 261-296, Sept. 1987.
3. J.L. Gailly, "Gzip program and documentation," 1993; available by anonymous ftp from prep.ai.mit.edu:/pub/gnu/gzip-.tar.
4. J. Zobel and A. Moffat, "Adding compression to a full-text retrieval system," Softw.-Pract. Exp., vol. 25, pp. 891-903, Aug. 1995.
5. M. Hankamer, "A modified Huffman procedure with reduced memory requirements," IEEE Trans. Commun., vol. 27, pp. 930-932, June 1979.
6. J. van Leeuwen, "On the construction of Huffman trees," in Proc. 3rd Int. Colloquium Automata, Languages, and Programming, Edinburgh Univ., Scotland, July 1976, pp. 382-410.
7. J. Katajainen and A. Moffat, "In-place calculation of minimumredundancy codes," submitted. Preliminary version in Proc. 1995 Workshop Algorithms and Data Structures, Kingston, Ont., Canada, Aug. 1995, pp. 393-4102. Source code available from http://www.es.mu.oz.auralistair/inplace.c, Feb. 1997.
8. A. Moffat and A. Turpin, "Efficient construction of minimumredundancy codes for large alphabets," IEEE Trans. Inform. Theory, to be published. Preliminary version in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 1995, pp. 192-201.
9. E.S. Schwartz and B. Kallick, "Generating a canonical prefix encoding," Commun. ACM, vol. 7, pp. 166-169, Mar. 1964.
10. J.B. Connell, "A Huffman-Shannon-Fano code," Proc. IEEE, vol. 61, pp. 1046-1047, July 1973.
11. D.S. Hirschberg and D. A. Lelewer, "Efficient decoding of prefix codes," Commun. ACM, vol. 33, pp. 449-459, Apr. 1990.
12. R. Hashemian, "High speed search and memory efficient Huffman coding," IEEE Trans. Commun., vol. 43, pp. 2576-2581, Oct. 1995.
13. D.R. Mclntyre and F. G. Wolff, "An efficient implementation of Huffman decode tables," Congressus Numerantium, vol. 91, pp. 79-92, 1992.
14. M.A. Bassiouni and A. Mukherjee, "Efficient decoding of compressed data," J. Amer. Soc. Inform. Sci., vol. 46, pp. 1-8, Jan. 1995.
15. H. Tanaka, "Data structure of the Huffman codes and its application to efficient encoding and decoding," IEEE Trans. Inform. Theory, vol. IT-33, pp. 154-156, Jan. 1987.
16. Y. Choueka, S.T. Klein, and Y. Perl, "Efficient variants of Huffman codes in high level languages," in Proc. 8th ACM-SIGIR Conf. Inform. Retrieval, Montreal, Canada, June 1985, pp. 122-130, ACM, NY.
17. A. Sieminski, "Fast decoding of the Huffman codes," Inform. Processing Lett., vol. 26, pp. 237-241, May 1988.
18. A. Moffat, R.M. Neal, and I. H. Witten, "Arithmetic coding revisited," ACM Trans. Inform. Syst., to be published. Preliminary version in Proc. IEEEData Compression Conf., Snowbird, UT, Mar. 1995, pp. 202-211.
19. Source software available from ftp://munnari.oz.au/pub/arith_coder.
20. D. Harman, "Overview of the second text retrieval conference (TREC-2)," Inform. Processing Manage., vol. 31, pp. 271-289, May 1995.
21. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, no. 3, pp. 337-343, 1977.
22. I.H. Witten, A. Moffat, and T. C. Bell, Managing Gigabytes: Compress-ing and Indexing Documents and Images. New York: Van Nostrand Reinhold, 1994.
23. A. Moffat, J. Zobel, and N. Sharman, "Text compression for dynamic document databases," IEEE Trans. Knowledge Data Eng., vol. 9, pp. 302-313, Mar. 1997.
24. J. Katajainen, A. Moffat, and A. Turpin, "A fast and space-economical algorithm for length-limited coding," in Proc. Int. Symp. Algorithms and Computation, J. Staples, P. Eades, N. Katoh, and A. Moffat, Eds., Cairns, Australia, Dec. 1995, pp. 12-21, Springer-Verlag, LNCS 1004.