2008/09/08 by Michael Baer, Baer, Michael
Computer Science · Mathematics · #E.4 #FOS: Computer and information sciences #H.1.1 #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0809.1264
5 pages, 1 figure, presented at ISIT 2008
arxiv created 2008/09/08 · arxiv updated 2009/12/01
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.