Conference paper
Traffic studies of unbuffered Delta networks
P. Heidelberger, P.A. Franaszek
SIGMETRICS 1989
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. Heidelberger, P.A. Franaszek
SIGMETRICS 1989
P.A. Franaszek, John T. Robinson
IBM J. Res. Dev
P.A. Franaszek, J. Thomas
ISIT 1993
Randall A. Cieslak, P.A. Franaszek
IEEE ICC 1994