Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions

Details Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions

2007-11-14

arxiv.org/abs/0711.2102v1

Computer Science

Information Theory

Scientific paper

A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of sequences generated by independent and identically distributed (i.i.d.) sources were derived. In this paper, precise approximations are provided for the pattern block entropies for patterns of sequences generated by i.i.d. uniform and monotonic distributions, including distributions over the integers, and the geometric distribution. Numerical bounds on the pattern block entropies of these distributions are provided even for very short blocks. Tight bounds are obtained even for distributions that have infinite i.i.d. entropy rates. The approximations are obtained using general bounds and their derivation techniques. Conditional index entropy is also studied for distributions over smaller alphabets.

Affiliated with

Also associated with

No associations

Rating

Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-530109