A fast and space-economical algorithm for length-limited coding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1004, Issue , 1995, Pages 12-21

  Katajainen, Jyrki ^a   Moffat, Alistair ^b   Turpin, Andrew ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

REDUNDANCY;

AUXILIARY SPACE; CODEWORD LENGTH; PREFIX CODES; SPACE-ECONOMICAL ALGORITHMS; WORK SPACE;

SPACE TIME CODES;

EID: 84955570360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0015404     Document Type: Conference Paper

References (9)

1. T.C. Hu and K.C. Tan. Path length of binary search trees. SIAM Journal of Applied Mathematics, 22(2):225-234, March 1972.
2. D. A. Huffman. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Engineers, 40(9):1098-1101, September 1952.
3. L.L. Larmore and D.S. Hirschberg. A fast algorithm for optimal length-limited Huffman codes. Journal of the ACM, 37(3):464-473, July 1990.
4. L.L. Larmore and T.M. Przytycka. Constructing Huffman trees in parallel. SIAM Journal on Computing. To appear.
5. A. Moffat and J. Katajainen. In-place calculation of minimum-redundancy codes. In Proc. Workshop on Algorithms and Data Structures, Kingston University, Canada, August 1995. Springer-Verlag. To appear.
6. A. Moffat, A. Turpin, and J. Katajainen. Space-efficient construction of optimal prefix codes. In Proc. IEEE Data Compression Conference, pages 192-201, Snowbird, Utah, March 1995. IEEE Computer Society Press, Los Alamitos, California.
7. B. Schieber. Computing a minimum-weight fc-link path in graphs with the concave Monge property. In Proc. 6th Ann. Symp. Discrete Algorithms, pages 405-411, San Francisco, California, January 1995. SIAM, Philadelphia, Pennsylvania.
8. J. van Leeuwen. On the construction of Huffman trees. In Proc. 3rd International Colloquium on Automata, Languages, and Programming, pages 382-410, Edinburgh University, Scotland, July 1976.
9. D.C. Van Voorhis. Constructing codes with bounded codeword lengths. IEEE Transactions on Information Theory, IT-20(2):288-290, March 1974.