Conference paper
Access invariance and its use in high contention environments
P.A. Franaszek, John T. Robinson, et al.
ICDE 1990
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, John T. Robinson, et al.
ICDE 1990
P.A. Franaszek, J.R. Haritsa, et al.
ICDCS 1992
C. Benveniste, P.A. Franaszek, et al.
IEEE TC
P.A. Franaszek, C.J. Georgiou, et al.
IBM J. Res. Dev