Codes with monotonic codeword lengths

Abstract

The author studies minimum average codeword length coding under the constraint that the codewords are monotonically non-decreasing in length. She derives bounds on the average length of an optimal 'monotonic' code, and gives sufficient conditions such that algorithms for optimal alphabetic codes can be used to find the optimal 'monotonic' code.<>