John T. Robinson, P.A. Franaszek
ICDE 1994
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.
John T. Robinson, P.A. Franaszek
ICDE 1994
P.A. Franaszek, John T. Robinson
IBM J. Res. Dev
A.X. Widmer, P.A. Franaszek
Electronics Letters
P.A. Franaszek, John T. Robinson, et al.
ICDE 1991