Lower Bounds of The ‘Useful' Mean Code Word Length for the Best 1:1 Code
Jump To References Section
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.
Downloads
Download data is not yet available.
Metrics
Metrics Loading ...
Downloads
Published
1988-12-01
How to Cite
Jain, P., & Tuteja, R. K. (1988). Lower Bounds of The ‘Useful’ Mean Code Word Length for the Best 1:1 Code. The Journal of the Indian Mathematical Society, 53(1-4), 231–236. Retrieved from https://www.informaticsjournals.com/index.php/jims/article/view/22013
Issue
Section
Articles
License
Copyright (c) 1988 Priti Jain, R. K. Tuteja
This work is licensed under a Creative Commons Attribution 4.0 International License.