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 …
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 …
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 …
O Parkash, P Kakkar - Applied Mathematics, 2014 - scirp.org
In the present communication, we have obtained the optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is …
M Khosravifard, H Saidi, M Esmaeili… - IEEE transactions on …, 2007 - ieeexplore.ieee.org
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 …
B Montgomery, B Kumar - IEEE transactions on information …, 1987 - ieeexplore.ieee.org
Although optimal binary source coding using symbol blocks of increasing length must eventually yield a code having an average codeword length arbitrarily close to the source …
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 …
R Nomura, H Yagi - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
The variable-length source coding problem allowing the error probability up to some constant is considered for general sources. In this problem, the optimum mean codeword …
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 …