DocumentCode :
1304274
Title :
Bit probabilities of optimal binary source codes
Author :
Montgomery, Bruce L. ; Diamond, Harvey ; Kumar, B. V K Vijaya
Author_Institution :
Dept. of Electr. Eng., Pittsburgh Univ., PA, USA
Volume :
36
Issue :
6
fYear :
1990
fDate :
11/1/1990 12:00:00 AM
Firstpage :
1446
Lastpage :
1450
Abstract :
The probabilities of the bits produced by an optimal binary source encoder for a memoryless source are analyzed. The class of sources for which the probability of zero must equal 1/2 for any such encoder is described. Procedures that minimize (maximize) the absolute difference of the bit probabilities are discussed. Corresponding upper bounds are derived and compared for the class of uniform sources
Keywords :
error correction codes; probability; bit probabilities; encoder; memoryless source; optimal binary source codes; upper bounds; Arithmetic; Binary codes; Data compression; Decoding; Electrons; Notice of Violation; Source coding; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.59942
Filename :
59942
Link To Document :
بازگشت