Minimum average codeword length coding under the constraint that the c
ode-words are monotonically nondecreasing in length is studied. Bounds
on the average length of an optimal ''monotonic'' code are derived, a
nd sufficient conditions are given such that algorithms for optimal al
phabetic codes can be used to find the optimal ''monotonic'' code.