For the direct half of the code-distribution correspondence, let be the length function of a binary prefix code and putThen is a probability mass function andThus every prefix code determines a distribution whose ideal description lengths do not exceed the codeword lengths.
Conversely, given a probability mass function , setfor . Then , so the Kraft inequality is satisfied. Its converse supplies a binary prefix code with these lengths, andIf real lengths are allowed, the ideal choice satisfies Kraft with equality.
Articles by others on the same topic
There are currently no matching articles.