3 citations · 3 across the 4 of their papers we have counts for
4 papers
Tight Bounds on Minimum Maximum Pointwise Redundancy
Michael Baer
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…
Reserved-Length Prefix Coding
Michael B. Baer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod…
-ary Bounded-Length Huffman Coding
Michael B. Baer
Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman…
Infinite-Alphabet Prefix Codes Optimal for -Exponential Penalties
Michael B. Baer
Let be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorit…