P.A. Franaszek, J. Thomas
ISIT 1995
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.
P.A. Franaszek, J. Thomas
ISIT 1995
P.A. Franaszek, John T. Robinson, et al.
ICDE 1991
P. Heidelberger, P.A. Franaszek
SIGMETRICS 1989
P.A. Franaszek, J. Thomas, et al.
ISIT 1994