DocumentCode :
931717
Title :
Optimal noiseless coding of random variables (Corresp.)
Author :
Dunham, James G.
Volume :
26
Issue :
3
fYear :
1980
fDate :
5/1/1980 12:00:00 AM
Firstpage :
345
Lastpage :
345
Abstract :
For a discrete 
-valued random variable 
, Leung-Yan-Cheung and Cover recently showed that the minimal expected length of one-to-one (not necessarily uniquely decodable) codes satisfies 
. A simple and direct proof of their lower bound is given which does not use the method of Lagrange multipliers.
-valued random variable , Leung-Yan-Cheung and Cover recently showed that the minimal expected length of one-to-one (not necessarily uniquely decodable) codes satisfies . A simple and direct proof of their lower bound is given which does not use the method of Lagrange multipliers.Keywords :
Coding; Decoding; Entropy; Error correction codes; Information theory; Lagrangian functions; Random variables; Rate distortion theory; Reliability theory; Stochastic processes; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1980.1056200
Filename :
1056200
Link To Document :
