On the entropy rate of pattern processes

被引：0

作者：

Gemelos, GM ^{[1
]}

Weissman, T ^{[1
]}

机构：

[1] Stanford Univ, Dept Elect Engn, Stanford, CA 95305 USA

来源：

DCC 2005: Data Compression Conference, Proceedings | 2005年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Recent work by Orlitsky et. al has motivated the study of pattern sequences and their compressibility properties. Emphasis in this recent line of work has been on compressing pattern sequences under uncertainty in the source that has generated them, thus focusing on universal schemes and their redundancy. Our interest in this work is in the entropy rate of pattern sequences of stochastic processes, and its relationship to the entropy rate of the original process. We give a complete characterization of this relationship for i.i.d. processes over arbitrary alphabets, stationary and ergodic processes over discrete alphabets, as well as more general processes that can be represented as the output of an additive white-noise channel. For cases where the entropy rate of the pattern process is infinite, we characterize the possible growth rate of the block entropy.

引用

页码：233 / 242

页数：10

共 13 条

[1] CHUNG KL, 1961, ANN MATH STAT, V32, P612, DOI 10.1214/aoms/1177705069
[2] GEMELOS G, 2004, HPL2004159
[3] GEMELOS G, UNPUB IEEE T INFORMA
[4] JEVTIC N, P 2002 IEEE INT S IN, P302
[5] Universal compression of memoryless sources over unknown alphabets
Orlitsky, A
Santhanam, NP
Zhang, JA
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (07) : 1469 - 1481
[6] ORLITSKY A, 2004, P IEEE INF THEOR WOR
[7] ORLITSKY A, P 2003 DAT COMPR C
[8] ORLITSKY A, P 2003 IEEE INT S IN, P111
[9] SHAMIR GI, P 2004 DAT COMPR C, P419
[10] SHAMIR GI, P 2004 IEEE INT S IN, P27

← 1 2 →