Codes with monotonic codeword lengths

摘要

Minimum average codeword length coding under the constraint that the codewords are monotonically nondecreasing in length is studied. Bounds on the average length of an optimal “monotonie” code are derived, and sufficient conditions are given such that algorithms for optimal alphabetic codes can be used to find the optimal “monotonic” code.