Coding on countably infinite alphabets

Mathematics – Statistics Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

33 pages

Scientific paper

This paper describes universal lossless coding strategies for compressing sources on countably infinite alphabets. Classes of memoryless sources defined by an envelope condition on the marginal distribution provide benchmarks for coding techniques originating from the theory of universal coding over finite alphabets. We prove general upper-bounds on minimax regret and lower-bounds on minimax redundancy for such source classes. The general upper bounds emphasize the role of the Normalized Maximum Likelihood codes with respect to minimax regret in the infinite alphabet context. Lower bounds are derived by tailoring sharp bounds on the redundancy of Krichevsky-Trofimov coders for sources over finite alphabets. Up to logarithmic (resp. constant) factors the bounds are matching for source classes defined by algebraically declining (resp. exponentially vanishing) envelopes. Effective and (almost) adaptive coding techniques are described for the collection of source classes defined by algebraically vanishing envelopes. Those results extend ourknowledge concerning universal coding to contexts where the key tools from parametric inference

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Coding on countably infinite alphabets 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 Coding on countably infinite alphabets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding on countably infinite alphabets will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-159725

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.