P.A. Franaszek, T.J. Wagner
Journal of the ACM
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, T.J. Wagner
Journal of the ACM
P.A. Franaszek, P. Heidelberger, et al.
IBM J. Res. Dev
P.A. Franaszek, John T. Robinson, et al.
DCC 1996
Randall A. Cieslak, P.A. Franaszek
IEEE ICC 1994