Publish in OALib Journal
APC: Only $99
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 minimized. Here, we have taken the case of various generalized mean codeword
lengths. Moreover, the upper bound to these codeword lengths has been found for
the case of Huffman encoding.
The following article has been retracted due to special reason of the author. This paper published in Vol.5 No. 2, 2013, has been removed from this site.