Algorithm for Huffman Codes



A Fast Algorithm for Optimal Length-Limited Huffman Codes

FREE-DOWNLOAD [PDF]LL LARMORE… – Journal ofthe Association for …
Abstract. An O(nL)-time algorithm is introduced for constructing an optimal Huffman code for
a weighted alphabet of size n, where each code string must have length no greater than L. The
algorithm uses O(n) space.  Categories and Subject Descriptors: E.4 [Coding and 




IEEE PAPER UNITED STATES