Efficient construction of minimum-redundancy codes for large alphabets

IEEE Transactions on Information Theory

Volumn 44, Issue 4, 1998, Pages 1650-1657

  Moffat, Alistair ^a   Turpin, Andrew ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Adaptive algorithm; Huffman code; Length limited code; Minimum redundancy code; Package merge algorithm; Prefix free code; Text compression

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA COMPRESSION; ENCODING (SYMBOLS); REDUNDANCY;

HUFFMAN CODE; LARGE ALPHABETS; LENGTH LIMITED CODES; MINIMUM REDUNDANCY CODES; PACKAGE MERGE ALGORITHMS;

CODES (SYMBOLS);

EID: 0032122711     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.681345     Document Type: Article

References (26)

1. J. L. Gailly, "Gzip program and documentation," 1993, available by anonymous FTP from prep.ai.mit.edu:/pub/gnu/gzip-*.tar.
2. J. Zobel and A. Moffat, "Adding compression to a full-text retrieval sys-tem," Software-Practice and Experience, vol. 25, no. 8, pp. 891-903, Aug. 1995.
3. D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. Inst. Radio Eng., vol. 40, no. 9, pp. 1098-1101, Sept. 1952.
4. J. van Leeuwen, "On the construction of Huffman trees," in Proc. 3rd Int. Coll. Automata, Languages, and Programming (Edinburgh Univ., Edinburgh, Scotland, July 1976), pp. 382-410.
5. A. Moffat and J. Katajainen, "In-place calculation of minimumredundancy codes," in Proc. Work. Algorithms and Data Structures, S. G. Akl, F. Dehne, and J.-R. Sack, Eds. (Kingston Univ., Kingston, Ont., Canada, Aug. 1995). New York: Springer-Verlag, 1995, pp. 393-402, LNCS 955.
6. A. Moffat and A. Turpin, "On the implementation of minimumredundancy prefix codes," IEEE Trans. Commun., vol. 45, pp. 1200-1207, Oct. 1997.
7. D. Harman, "Overview of the second text retrieval conference (TREC2)," Inform. Processing Manag., vol. 31, no. 3, pp. 271-289, May 1995.
8. M. Büro, "On the maximum length of Huffman codes," Inform. Processing Lett., vol. 45, no. 5, pp. 219-223, Apr. 1993.
9. L. L. Larmore and D. S. Hirschberg, "A fast algorithm for optimal length-limited Huffman codes," J. Assoc. Comput. Mach., vol. 37, no. 3, pp. 464-473, July 1990.
10. 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). New York: Springer-Verlag, 1995, pp. 12-21, LNCS 1004.
11. T. C. Hu and K. C. Tan, "Path length of binary search trees," SIAM J. Appl. Math., vol. 22, no. 2, pp. 225-234, Mar. 1972.
12. R. Sedgewick, Algorithms in C. Reading, MA: Addison-Wesley, 1990.
13. G. K. Zipf, Human Behaviour and the Principle of 'Least Effort. Reading, MA: Addison-Wesley, 1949.
14. R. G. Gallager, "Variations on a theme by Huffman," IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, Nov. 1978.
15. J. Bentley and A. C-C. Yao, "An almost optimal algorithm for unbounded searching," Inform. Processing Lett., vol. 5, no. 3, pp. 82-87, Aug. 1976.
16. P. Elias, "Universal codeword sets and representations of the integers," IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, Mar. 1975.
17. R. E. Tarjan, "Amortised computational complexity," SIAM J. Appl. Discr. Methods, vol. 6, no. 2, pp. 306-318, Apr. 1985.
18. A. Turpin and A. Moffat, "Efficient approximate adaptive coding," in Proc. IEEE Data Compression Conf., J. A. Storer and M. Cohn, Eds. (Snowbird, UT, Mar. 1997). Los Alamitos, CA: IEEE Computer Soc. Press, 1997, pp. 357-366.
19. A. S. Fraenkel and S. T. Klein, "Bounding the depth of search trees," Comp. J., vol. 36, no. 7, pp. 668-678, 1993.
20. L. L. Larmore and T. M. Przytycka, "Constructing Huffman trees in parallel," SIAM J. Comput., vol. 24, pp. 1163-1169, 1995.
21. B. Schieber, "Computing a minimum-weight fc-link path in graphs with the concave Monge property," in Proc. 6th Ann. Symp. Discrete Algorithms (San Francisco, CA, Jan. 1995). Philadelphia, PA: SIAM, 1995, pp. 405-111.
22. A. Moffat and O. Petersson, "An overview of adaptive sorting," Australian Comput. J., vol. 24, no. 2, pp. 70-77, May 1992.
23. O. Petersson and A. Moffat, "A framework for adaptive sorting," Discr. Appl. Math., vol. 59, no. 2, pp. 153-179, 1995.
24. D. E. Knuth, "Dynamic Huffman coding," J. Algorithms, vol. 6, pp. 163-180, 1985.
25. J. S. Vitter, "Design and analysis of dynamic Huffman codes," J. Assoc. Comput. Mach., vol. 34, no. 4, pp. 825-845, Oct. 1987.
26. _, "Algorithm 673: Dynamic Huffman coding," ACM Trans. Math. Software, vol. 15, no. 2, pp. 158-167, June 1989.