Constructing codes with ordered codeword lengths (Corresp.)
D. van Voorhis · IEEE Transactions on Information Theory · 1975
An algorithm is described where given the letter probabilities for a memoryless message source that emitsNletters, onlyO(N^2)steps are required--rather than the previously reportedO(N^3)steps---to construct a code with the minimum average codeword length permitted by the constraint that codeword lengths be monotonically increasing.