Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
A new lower bound for the mean code length of all one-to-one codes for a random variable with n outcomes is derived. The bound, which is tight, improves an earlier one due to Leung-Yan-Cheong and Cover. Another bound for one-to-one codes for binary information sources is derived. ©1982 IEEE
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
György E. Révész
Theoretical Computer Science