Abstract Views :165 |
PDF Views:0
Authors
Affiliations
1 Department of Mathematics, Maharishi Dayanand University, Rohtak— 124001, IN
Source
The Journal of the Indian Mathematical Society, Vol 53, No 1-4 (1988), Pagination: 231-236
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.