Lower Bounds of The ‘Useful’ Mean Code Word Length for the Best 1:1 Code

Abstract

The mean length of a noiseless uniquely decodable code for a discrete r.v. X satisfies

H(p) + 1 > L ≥ H(P).

where H{P) is the Shannon’s entropy associated with the discrete complete probability distribution P.