Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
György E. Révész
Theoretical Computer Science
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008