DocumentCode
2495327
Title
Almost sure source coding theorems for general sources
Author
Muramatsu, Jun ; Kanaya, Fumio
Author_Institution
NTT Commun. Sci. Labs., Kyoto, Japan
fYear
1998
fDate
16-21 Aug 1998
Firstpage
428
Abstract
For a source μ, which is assumed to be a probability measure on all strings of infinite length sequence with a finite alphabet, the notion of the almost-sure entropy rate is defined; it is an extension of the Shannon (1948) entropy rate. When both an encoder and a decoder know that a sequence is generated by μ, the optimal almost sure source coding rate is equal to the almost sure sup entropy rate
Keywords
decoding; entropy; probability; source coding; Shannon entropy rate; almost sure entropy rate; almost sure sup entropy rate; decoder; encoder; finite alphabet; general sources; infinite length sequence; optimal almost sure source coding rate; probability measure; source coding theorems; Approximation methods; Codes; Decoding; Entropy; Extraterrestrial measurements; Information systems; Information theory; Laboratories; Length measurement; Source coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.709033
Filename
709033
Link To Document