Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
Paper
Tight Lower Bounds for Optimum Code Length
Abstract
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
Related
Raymond Wu, Jie Lu
ITA Conference 2007
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Fan Zhang, Junwei Cao, et al.
IEEE TETC