Department of Computer Science & Engineering

We determine the entropy rate of patterns of certain random processes, bound the speed at which the per-symbol pattern entropy converges to this rate, and show that patterns satisfy an asymptotic equipartition property. To derive some of these results we upper bound the probability that the n'th variable in a random process differs from all preceding ones.

Pre-2018 CSE ID: CS2004-0811