On synchronous variable length coding for discrete noiseless chrannels

A method is presented for finding the shortest variable length codes with a given bit per symbol ratio for discrete noiseless channels. The central feature of the procedure is a dynamic programming algorithm for determining the optimal code paths. Bounds are found for the channel capacity. © 1969 Academic Press, Inc.