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 …

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 …

The problem of designing a fixed code for encoding all monotone sources with a large
alphabet size n is studied. It is proved that if the code-lengths of a code sequence are of …

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 …

Consider the source coding problem of finding the optimal code, in the sense of average
redundancy, for the class of monotone sources with n symbols. The solution of this problem …

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

We offer two noiseless codes for blocks of integers X/sup n/=(X/sub 1/,..., X/sub n/). We
provide explicit bounds on the relative redundancy that are valid for any distribution F in the …

Huffman's algorithm gives optimal codes, as measured by average codeword length, and
the redundancy can be measured as the difference between the average codeword length …

Let X/sup n/=(X/sub 1/,..., X/sub n/) be a memoryless source with unknown distribution on a
finite alphabet of size k. We identify the asymptotic minimax coding redundancy for this class …