Almost-sure variable-length source coding theorems for general sources

Source coding theorems for general sources are presented. For a source /spl mu/, which is assumed to be a probability measure on all strings of an infinite-length sequence with a finite alphabet, the notion of almost-sure sup entropy rate is defined; it is an extension of the Shannon entropy rate. W...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 45; no. 1; pp. 337 - 342
Main Authors:	Muramatsu, J., Kanaya, F.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.01.1999 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Codes Decoding Entropy Extraterrestrial measurements Information technology Information theory Length measurement Mathematics Memoryless systems Source coding
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!