dblp.uni-trier.dewww.uni-trier.de

Michael B. Baer Vis

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
17EEMichael B. Baer: Reserved-Length Prefix Coding CoRR abs/0801.0102: (2008)
16EEMichael B. Baer: Efficient Implementation of the Generalized Tunstall Code Generation Algorithm CoRR abs/0809.0949: (2008)
15EEMichael B. Baer: Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs. IEEE Transactions on Information Theory 54(3): 1273-1286 (2008)
2007
14EEMichael B. Baer: Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties CoRR abs/cs/0701011: (2007)
13EEMichael B. Baer: D-ary Bounded-Length Huffman Coding CoRR abs/cs/0701012: (2007)
12EEMichael B. Baer: Bounds on Generalized Huffman Codes CoRR abs/cs/0702059: (2007)
2006
11EEMichael B. Baer: Renyi to Renyi -- Source Coding under Siege CoRR abs/cs/0602067: (2006)
10EEMichael B. Baer: Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding CoRR abs/cs/0602085: (2006)
9EEMichael B. Baer: On Conditional Branches in Optimal Search Trees CoRR abs/cs/0604016: (2006)
8EEMichael B. Baer: Prefix Coding under Siege CoRR abs/cs/0605099: (2006)
7EEMichael B. Baer: On Conditional Branches in Optimal Decision Trees CoRR abs/cs/0611037: (2006)
6EEMichael B. Baer: Prefix Codes for Power Laws with Countable Support CoRR abs/cs/0611073: (2006)
5EEMichael B. Baer: A general framework for codes involving redundancy minimization. IEEE Transactions on Information Theory 52(1): 344-349 (2006)
4EEMichael B. Baer: Source Coding for Quasiarithmetic Penalties. IEEE Transactions on Information Theory 52(10): 4380-4393 (2006)
2005
3EEMichael B. Baer: A General Framework for Codes Involving Redundancy Minimization CoRR abs/cs/0508083: (2005)
2EEMichael B. Baer: Source Coding for Quasiarithmetic Penalties CoRR abs/cs/0508084: (2005)
1EEMichael B. Baer: Optimal Prefix Codes for Infinite Alphabets with Nonlinear Costs CoRR abs/cs/0511003: (2005)

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)