Huffman redundancy for large alphabet sources
H Narimani, M Khosravifard - IEEE Transactions on information …, 2013 - ieeexplore.ieee.org
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 …
alphabet size is studied. It is shown that the redundancy of the Huffman code for almost all …
On the penalty of optimal fix-free codes
SJ Zahabi, M Khosravifard - IEEE Transactions on Information …, 2015 - ieeexplore.ieee.org
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 …
free code, and that of the optimal prefix-free code is considered as the penalty of benefiting …
On the structure of the minimum average redundancy code for monotone sources
P Rastegari, M Khosravifard… - IEEE …, 2014 - ieeexplore.ieee.org
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 …
source is the number of symbols n and the order of the symbol probabilities. In this case, the …
A new code for encoding all monotone sources with a fixed large alphabet size
H Narimani, M Khosravifard - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
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 …
alphabet size n is studied. It is proved that if the code-lengths of a code sequence are of …