Huffman & Shannon

In Huffman codes, when using any radix rather than binary, the equation to check onto the number of symbols is:

• r + (r-k)

• k + k (r-1)

• r + r (k-1)

• r + k (r-1)

To calculate any efficiency, it is the ratio between ....

• the output to the input

• the input to the output

What is the output for any communication channel?

• Entropy

• Information

• Average Code Word Length

• Length of the code

What is the input for any communication channel?

• Entropy

• Information

• Average Code Word Length

• Length of the code

In Huffman codes, when the number of source extension increases, the efficiency ....

• Increases

• Decreases

• According to the problem

In Huffman codes, to calculate the entropy of the 4th extension, it is equal to ....

• 2 * Entropy of source

• 4 * Entropy of 3rd source

• 2 * Entropy of 2nd source

• 4 * Entropy of source

In Shannon-Fano codes, the length of each code is calculated using the ceiling of ....

• Entropy

• Information

• Average Code Word Length

In Shannon-Fano codes, the efficiency increases when ...

• the number of source extension remain the same

• the number of source extension increases

• the number of source extension decreases

Both Huffman and/or Shannon-Fano codes have to produce ------ codes

• uniquely decodable

• instantaneous

• prefix