TITLE:
Optimum Probability Distribution for Minimum Redundancy of Source Coding
AUTHORS:
Om Parkash, Priyanka Kakkar
KEYWORDS:
Mean Codeword Length; Uniquely Decipherable Code; Kraft’s Inequality; Entropy; Optimum Probability Distribution; Escort Distribution; Source Coding
JOURNAL NAME:
Applied Mathematics,
Vol.5 No.1,
January
7,
2014
ABSTRACT: 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.