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

Publisher Website

1 January 1995

book chapter
Published by Springer Nature

p. 12-21
https://doi.org/10.1007/bfb0015404

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

Constructing Huffman Trees in Parallel
SIAM Journal on Computing, 1995
A fast algorithm for optimal length-limited Huffman codes
Journal of the ACM, 1990
Constructing codes with bounded codeword lengths (Corresp.)
IEEE Transactions on Information Theory, 1974
Path Length of Binary Search Trees
SIAM Journal on Applied Mathematics, 1972