Codes & r-ary Tree

To calculate the average code word length, it is the summation of the product between ...

• each probability * its information

• each probability * its code length

• each probability * its entropy

• each probability * its conditional entropy

In general, what is the unit of measurement for any average code word length?

Any memory-less source, is the source for which ...

• its symbols don't depend on the preceding ones

• its symbols' probabilities don't change in time

The type of source whose symbols' probabilities don't change in time, is called ...

Given a source Si with codes: {01, 10, 001, 11} Is this code prefix?

• Yes

• No

Given a source Si with codes: {10, 010, 110, 11} Is this code prefix?

• Yes

• No

Given a source Si with codes: {110, 100, 001, 1001} Is this code prefix?

• Yes

• No

If code 1 is of average code length L₁ = 1.7 binary digits, and code 2 is of L₂ = 1.6 binary digits

• Code1 is better than Code2

• Code2 is better than Code1

Why is Code2 better than Code1?

Kraft-McMillan inequality is to satisfy that a certain code could be instantaneous or not by checking that the summation of ....

• 1/r <= 1

• 1/length^r <= 1

• 1/r^2 > 1

• 1/r^length <= 1

• 1/r^length > 1