For the case in which the code alphabet consists of M letters, we derive the optimum
probability distribution of a discrete source that assures the minimum average codeword …

Minimum-cost encoding of information. Coding with digits of unequal cost Page 1 TELSlKS’99
13-1 5. October 1999, ”IS, Yugoslavia Minimum-Cost Encoding of Information Coding with …

In this paper, the average probability distribution P~/sup N/~ of equiprobable finite monotone
sources, where N is the number of symbols, is derived and some properties of this …

In order to determine how suboptimal the Shannon code is, one should compare its
performance with that of the optimal code, ie, the corresponding Huffman code, in some …

The source coding problem is considered where the only information known about the
source is the number of symbols n and the order of the symbol probabilities. In this case, the …

A new twist to the classical problem of compressing a discrete source over noiseless
channel alphabets where different code symbols may have different transmission costs is …

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 …

The problem of selecting a code for finite monotone sources with N symbols is considered.
The selection criterion is based on minimizing the average redundancy (called Minave …

For a given set of N symbols to be coded by a code of alphabet size D, the necessary and
sufficient conditions for the optimality of a block code of length m, if N= D^ m, and the …

A tight upper bound on the redundancy r of Huffman codes, in terms of the minimum
codeword length l, l≥ 1, is provided. The bound is a strictly decreasing function of l. For …