Tight Bounds on Minimum Maximum Pointwise Redundancy

Details Tight Bounds on Minimum Maximum Pointwise Redundancy Tight Bounds on Minimum Maximum Pointwise Redundancy

2008-09-08

arxiv.org/abs/0809.1264v1

Computer Science

Information Theory

5 pages, 1 figure, presented at ISIT 2008

Scientific paper

This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of minimizing maximum pointwise redundancy. This objective relates to both universal modeling and Shannon coding, and these bounds are tight throughout the interval. The upper bounds also apply to a related objective, that of dth exponential redundancy.

Affiliated with

Also associated with

No associations

Rating

Tight Bounds on Minimum Maximum Pointwise Redundancy 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 Tight Bounds on Minimum Maximum Pointwise Redundancy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight Bounds on Minimum Maximum Pointwise Redundancy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30295