Universal finitary codes with exponential tails

Details Universal finitary codes with exponential tails Universal finitary codes with exponential tails

2005-02-23

arxiv.org/abs/math/0502484v1

Mathematics

Probability

33 pages

Scientific paper

In 1977, Keane and Smorodinsky showed that there exists a finitary homomorphism from any finite-alphabet Bernoulli process to any other finite-alphabet Bernoulli process of strictly lower entropy. In 1996, Serafin proved the existence of a finitary homomorphism with finite expected coding length. In this paper, we construct such a homomorphism in which the coding length has exponential tails. Our construction is source-universal, in the sense that it does not use any information on the source distribution other than the alphabet size and a bound on the entropy gap between the source and target distributions. We also indicate how our methods can be extended to prove a source-specific version of the result for Markov chains.

Affiliated with

Also associated with

No associations

Rating

Universal finitary codes with exponential tails 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 Universal finitary codes with exponential tails, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal finitary codes with exponential tails will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-399159