An algorithm is described where given the letter probabilities for a memoryless message source that emits

letters, only

steps are required--rather than the previously reported

steps---to construct a code with the minimum average codeword length permitted by the constraint that codeword lengths be monotonically increasing.