# Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties

@article{Baer2007InfiniteAlphabetPC, title={Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties}, author={Michael B. Baer}, journal={ArXiv}, year={2007}, volume={abs/cs/0701011} }

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a source code that is optimal in the sense of minimizing expected codeword length. For some applications, however, a source code should instead minimize one of a family of nonlinear objective functions, $\beta$-exponential means, those of the form $\log_a…

## References

SHOWING 1-10 OF 36 REFERENCES

Source Coding for Quasiarithmetic Penalties

- Computer ScienceIEEE Transactions on Information Theory
- 2006

Several cost functions are shown here to yield quasiarithmetic problems with simple redundancy bounds in terms of a generalized entropy, which reduces the computational complexity of a problem involving minimum delay in a queue, allows combinations of previously considered problems to be optimized, and greatly expands the set of problems solvable in quadratic time and linear space.

The Rényi redundancy of generalized Huffman codes

- Computer ScienceIEEE Trans. Inf. Theory
- 1988

By decreasing some of the codeword lengths in a Shannon code, the upper bound on the redundancy given in the standard proof of the noiseless source coding theorem is improved and the lower bound is improved by randomizing between codewords, allowing linear programming techniques to be used on an integer programming problem.

Huffman coding with an infinite alphabet

- Computer ScienceIEEE Trans. Inf. Theory
- 1996

Two new concepts of the optimality of a prefix D-ary code are introduced, which are shown to be equivalent to that defined in the traditional way for the case where the Shannon entropy H(P) diverges.

Buffer overflow in variable length coding of fixed rate sources

- Computer ScienceIEEE Trans. Inf. Theory
- 1968

In this paper, we develop and analyze an easily instrumentable scheme for variable length encoding of discrete memoryless fixed-rate sources in which buffer overflows result in codeword erasures at…

Optimal source codes for geometrically distributed integer alphabets (Corresp.)

- Computer ScienceIEEE Trans. Inf. Theory
- 1975

An approach is shown for using the Huffman algorithm indirectly to prove the optimality of a code for an infinite alphabet if an estimate concerning the nature of the code can be made. Attention is…

On variable-length-to-block coding

- Computer ScienceIEEE Trans. Inf. Theory
- 1972

It turns out that the optimum error exponents of variable-length- to-block coding are identical with those of block-to-variable-length coding and are related in an interesting way to Renyi's generalized entropy function.

Renyi to Renyi - Source Coding under Siege

- Computer Science2006 IEEE International Symposium on Information Theory
- 2006

A novel lossless source coding paradigm applies to problems of unreliable lossless channels with low bit rates, in which a vital message needs to be transmitted prior to termination of…

A general framework for codes involving redundancy minimization

- Computer ScienceIEEE Transactions on Information Theory
- 2006

A framework with two scalar parameters is introduced for various problems of finding a prefix code minimizing a coding penalty function, shedding light on the relationships among these problems previously proposed by Huffman, Campbell, Nath, and Drmota and Szpankowski.

Generalization of Huffman coding to minimize the probability of buffer overflow

- Computer ScienceIEEE Trans. Inf. Theory
- 1981

An algorithm is given to find a prefix condition code that minimizes the value of the moment generating function of the codeword length distribution for a given positive argument. This algorithm is…