Tight Bounds on Minimum Maximum Pointwise Redundancy

Simple item page
dc.creatorBaer, Michael
dc.date2008-09-08
dc.date.accessioned2026-07-07T10:01:21Z
dc.date.available2026-07-07T10:01:21Z
dc.descriptionThis 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.
dc.description5 pages, 1 figure, presented at ISIT 2008
dc.identifierhttps://arxiv.org/abs/0809.1264
dc.identifierhttp://arxiv.org/abs/0809.1264
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168606
dc.subjectInformation Theory
dc.subjectE.4; H.1.1
dc.titleTight Bounds on Minimum Maximum Pointwise Redundancy
dc.typetext

Files

Collections

arXiv