DocumentCode :
818462
Title :
Entropy and data compression schemes
Author :
Ornstein, D.S. ; Weiss, Benjamin
Author_Institution :
Dept. of Math., Stanford Univ., CA, USA
Volume :
39
Issue :
1
fYear :
1993
fDate :
1/1/1993 12:00:00 AM
Firstpage :
78
Lastpage :
83
Abstract :
Some new ways of defining the entropy of a process by observing a single typical output sequence as well as a new kind of Shannon-McMillan-Breiman theorem are presented. This provides a new and conceptually very simple ways of estimating the entropy of an ergodic stationary source as well as new insight into the workings of such well-known data compression schemes as the Lempel-Ziv algorithm
Keywords :
data compression; entropy; information theory; Lempel-Ziv algorithm; Shannon-McMillan-Breiman theorem; data compression; entropy; ergodic stationary source; Data compression; Entropy; Heart; Mathematics;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.179344
Filename :
179344
Link To Document :
بازگشت