Conference paper
Adaptive routing in Clos networks
P.A. Franaszek, C.J. Georgiou, et al.
ICCD 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, C.J. Georgiou, et al.
ICCD 1995
R.B. Tremaine, P.A. Franaszek, et al.
IBM J. Res. Dev
P.A. Franaszek, T.J. Wagner
Journal of the ACM
P. Heidelberger, P.A. Franaszek
SIGMETRICS 1989