On the Entropy Rate of Pattern Processes
Information Theory
2007-07-13 v2 math.IT
Abstract
We study 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 ergodic processes over discrete alphabets, and a broad family of stationary ergodic processes over uncountable alphabets. For cases where the entropy rate of the pattern process is infinite, we characterize the possible growth rate of the block entropy.
Keywords
Cite
@article{arxiv.cs/0504046,
title = {On the Entropy Rate of Pattern Processes},
author = {George M. Gemelos and Tsachy Weissman},
journal= {arXiv preprint arXiv:cs/0504046},
year = {2007}
}
Comments
Submitted to IEEE Transactions of Information Theory