26 citations · 73 across the 16 of their papers we have counts for
17 papers
Minimum Redundancy Coding for Uncertain Sources
Michael B. Baer, Farzad Rezaei, Charalambos D. Charalambous
Consider the set of source distributions within a fixed maximum relative entropy with respect to a given nominal distribution. Lossless source coding over this relative entropy bal…
Improved Redundancy Bounds for Exponential Objectives
Michael B. Baer
We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objecti…
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…
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
Michael B. Baer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources,…
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…