Reena Elangovan, Shubham Jain, et al.
ACM TODAES
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
Conference paper
Failure diagnosis with incomplete information in cable networks
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010