The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

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


Affiliations
1 Department of Mathematics, Maharishi Dayanand University, Rohtak— 124001, India
     

   Subscribe/Renew Journal


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.


Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 217

PDF Views: 0




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

Abstract Views: 217  |  PDF Views: 0

Authors

Priti Jain
Department of Mathematics, Maharishi Dayanand University, Rohtak— 124001, India
R. K. Tuteja
Department of Mathematics, Maharishi Dayanand University, Rohtak— 124001, India

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.