loading
Infinite-Alphabet Prefix Codes Optimal for ß-Exponential Penalties
2007 Edition, June 1, 2007 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

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...

Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
2008 Edition, Volume 54, March 1, 2008 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

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...

Existence of optimal prefix codes for infinite source alphabets
1997 Edition, Volume 43, November 1, 1997 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

It is proven that for every random variable with a countably infinite set of outcomes and finite entropy there exists an optimal prefix code which can be constructed from Huffman codes for truncated versions of the random variable, and that the...

Efficient and Compact Representations of Prefix Codes
2015 Edition, Volume 61, September 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Most of the attention in statistical compression is given to the space used by the compressed sequence, a problem completely solved with optimal prefix codes. However, in many applications, the storage space used to represent the prefix code itself can be an issue...

Prefix codes for power laws
2008 Edition, July 1, 2008 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In prefix coding over an infinite alphabet, methods that consider specific distributions generally consider those that decline more quickly than a power law (e.g., a geometric distribution for Golomb coding). Particular power-law distributions, however,...

A D-ary Huffman code for a class of sources with countably infinite alphabets
1995 Edition, January 1, 1995 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The authors discuss Huffman coding with infinite alphabet. Our concern is how to construct an optimal D-ary prefix code given a probability distribution P on /spl chi/, where "optimal" means a code with the minimum expected codeword length...

Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes
2017 Edition, Volume 63, September 1, 2017 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The optimal zero delay coding of a finite-state Markov source is considered. The existence and structure of optimal codes are studied using a stochastic control formulation. Prior results in the literature established the optimality of deterministic Markov...

Almost lossless variable-length source coding on countably infinite alphabets
2016 Edition, July 1, 2016 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, the notion of almost lossless source coding is introduced. This idea -analog to the weak variable-length source coding problem proposed by Han [1]- aims at...

Huffman Redundancy for Large Alphabet Sources
2014 Edition, Volume 60, March 1, 2014 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The performance of optimal prefix-free encoding for memoryless sources with a large alphabet size is studied. It is shown that the redundancy of the Huffman code for almost all sources with a large alphabet size n is very close to that of the average...

On the Penalty of Optimal Fix-Free Codes
2015 Edition, Volume 61, May 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In this paper, the difference between the redundancy of the optimal asymmetric/symmetric fix-free code, and that of the optimal prefix-free code is considered as the penalty of benefiting from the desired properties of fix-free codes. This...

Advertisement