Constructing codes with bounded codeword lengths (Corresp.)

Abstract
When the letter probabilitiesp_1,p_2,\cdots,p_Nfor a message sourceSare unknown, it may be imprudent to construct a Huffman code forSbased on the relative frequenciesf_1, f_2,\cdots, f_Nof the letters in a sample messageM. Rather, a more cautious approach is to select an integerb \geq \log_2 Nand to construct the codeC_bwhich encodesMmost efficiently subject to the restriction that codewords are at mostbbits long. This correspondence describes an algorithm for calculatingC_binO((b-\log_2 N)N^2)steps.

This publication has 6 references indexed in Scilit: