26 citations · 73 across the 16 of their papers we have counts for
4 papers · 1 filter
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…
Redundancy-Related Bounds on Generalized Huffman Codes
Michael B. Baer
This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length obje…
-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…