26 citations · 73 across the 16 of their papers we have counts for
Showing 2005 · cs.ITShow all
3 papers · 2 filters
cs.IT2005★ 13 cited
Optimal Prefix Codes for Infinite Alphabets with Nonlinear Costs
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…
cs.IT2005★ 26 cited
Source Coding for Quasiarithmetic Penalties
Michael B. Baer
Huffman coding finds a prefix code that minimizes mean codeword length for a given probability distribution over a finite number of items. Campbell generalized the Huffman problem…
cs.IT2005★ 21 cited
A General Framework for Codes Involving Redundancy Minimization
Michael B. Baer
A framework with two scalar parameters is introduced for various problems of finding a prefix code minimizing a coding penalty function. The framework encompasses problems previous…