It can be shown that a necessary and sufficient condition for the existence of an instantaneous binary

Question:

It can be shown that a necessary and sufficient condition for the existence of an instantaneous binary code with word lengths Ii, 1 ‰¤ i ‰¤ N, is 

2-li < 1 i=1

This is known as the Kraft inequality. Show that the Kraft inequality is satisfied by the code words given in Table 12.3. (Note: The inequality given above must also be satisfied for uniquely decipherable codes.)


Table 12.3 Third-Order Source Extension Source symbol Symbol probability P(·) Code word P(:), AAA 0.729 1 0.729 AAB 0.0

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: