Sciweavers

69
Voted
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 4 days ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
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 determ...
Michael Baer