Constructing codes with ordered codeword lengths (Corresp.)

An algorithm is described where given the letter probabilities for a memoryless message source that emits
N
letters, only
O(N^2)
steps are required--rather than the previously reported
O(N^3)
steps---to construct a code with the minimum average codeword length permitted by the constraint that codeword lengths be monotonically increasing.