For the direct half of the code-distribution correspondence, let be the length function of a binary prefix code and put
Then is a probability mass function and
Thus every prefix code determines a distribution whose ideal description lengths do not exceed the codeword lengths.
Conversely, given a probability mass function , set
for . Then , so the Kraft inequality is satisfied. Its converse supplies a binary prefix code with these lengths, and
If real lengths are allowed, the ideal choice satisfies Kraft with equality.

Articles by others on the same topic (0)

There are currently no matching articles.