Michael B. Baer

30 papers B 9Journal 21

Year	Rank	Type	Title / Venue / Authors
2013	B	`conf`	On the redundancy of Huffman codes with exponential objectives. ISIT Michael B. Baer
2011	J	`jnl`	Improved Redundancy Bounds for Exponential Objectives CoRR Michael B. Baer
2011	J	`jnl`	Minimum Redundancy Coding for Uncertain Sources CoRR Michael B. Baer, Farzad Rezaei, Charalambos D. Charalambous
2011	J	`jnl`	Redundancy-Related Bounds for Generalized Huffman Codes. IEEE Trans. Inf. Theory Michael B. Baer
2010	J	`jnl`	Alphabetic coding with exponential costs. Inf. Process. Lett. Michael B. Baer
2009	B	`conf`	Efficient implementation of the generalized Tunstall code generation algorithm. ISIT Michael B. Baer
2008	J	`jnl`	Efficient Implementation of the Generalized Tunstall Code Generation Algorithm CoRR Michael B. Baer
2008	J	`jnl`	Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs. IEEE Trans. Inf. Theory Michael B. Baer
2008	B	`conf`	Prefix codes for power laws. ISIT Michael B. Baer
2008	J	`jnl`	Reserved-Length Prefix Coding CoRR Michael B. Baer
2008	B	`conf`	Reserved-length prefix coding. ISIT Michael B. Baer
2008	B	`conf`	Tight bounds on minimum maximum pointwise redundancy. ISIT Michael B. Baer
2007	J	`jnl`	Bounds on Generalized Huffman Codes CoRR Michael B. Baer
2007	J	`jnl`	D-ary Bounded-Length Huffman Coding CoRR Michael B. Baer
2007	B	`conf`	D-ary Bounded-Length Huffman Coding. ISIT Michael B. Baer
2007	J	`jnl`	Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties CoRR Michael B. Baer
2007	B	`conf`	Infinite-Alphabet Prefix Codes Optimal for ß-Exponential Penalties. ISIT Michael B. Baer
2007	B	`conf`	On Conditional Branches in Optimal Decision Trees. ISIT Michael B. Baer
2006	J	`jnl`	A general framework for codes involving redundancy minimization. IEEE Trans. Inf. Theory Michael B. Baer
2006	J	`jnl`	On Conditional Branches in Optimal Decision Trees CoRR Michael B. Baer
2006	J	`jnl`	On Conditional Branches in Optimal Search Trees CoRR Michael B. Baer
2006	J	`jnl`	Prefix Codes for Power Laws with Countable Support CoRR Michael B. Baer
2006	J	`jnl`	Prefix Coding under Siege CoRR Michael B. Baer
2006	B	`conf`	Renyi to Renyi - Source Coding under Siege. ISIT Michael B. Baer
2006	J	`jnl`	Renyi to Renyi -- Source Coding under Siege CoRR Michael B. Baer
2006	J	`jnl`	Source Coding for Quasiarithmetic Penalties. IEEE Trans. Inf. Theory Michael B. Baer
2006	J	`jnl`	Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding CoRR Michael B. Baer
2005	J	`jnl`	A General Framework for Codes Involving Redundancy Minimization CoRR Michael B. Baer
2005	J	`jnl`	Optimal Prefix Codes for Infinite Alphabets with Nonlinear Costs CoRR Michael B. Baer
2005	J	`jnl`	Source Coding for Quasiarithmetic Penalties CoRR Michael B. Baer