IEEE Trans. Inf. Theory

Paper

01 Jan 1982

Tight Lower Bounds for Optimum Code Length

View publication

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

Paper

Tight bounds for delay-sensitive aggregation

Yvonne Anne Pignolet, Stefan Schmid, et al.

Discrete Mathematics and Theoretical Computer Science

Workshop paper

Intrapersonal retrospective recommendation: Lifestyle change recommendations using stable patterns of personal behavior

Robert G. Farrell, Catalina M. Danis, et al.

RecSys 2012

Paper

CODS: Evolving data efficiently and scalably in column oriented databases

Ziyang Liu, Sivaramakrishnan Natarajan, et al.

VLDB

Paper

On the capacities of bipartite Hamiltonians and unitary gates

Charles H. Bennett, Aram W. Harrow, et al.

IEEE Trans. Inf. Theory

View all publications