Construct a binary Huffman code for a source $S$ with three symbols $A, B$ and $C$, having probabilities $0.6,0.3$, and 0.1 , respectively. What is its average codeword length, in bits per symbol? What is the entropy of this source?
(b) Let's now extend this code by grouping symbols into 2-character groups - a type of VQ. Compare the performance now, in bits per original source symbol, with the best possible.
Fig. 7.1:

Question

Construct a binary Huffman code for a source $S$ with three symbols $A, B$ and $C$, having probabilities $0.6,0.3$, and 0.1 , respectively. What is its average codeword length, in bits per symbol? What is the entropy of this source? 
(b) Let's now extend this code by grouping symbols into 2-character groups - a type of VQ. Compare the performance now, in bits per original source symbol, with the best possible.
  Fig. 7.1:

Quizplus · Accepted Answer

The Answer of Construct a binary Huffman code for a source $S$ with three symbols $A, B$ and $C$, having probabilities $0.6,0.3$, and 0.1 , respectively. What is its average codeword length, in bits per symbol? What is the entropy of this source? 
(b) Let's now extend this code by grouping symbols into 2-character groups - a type of VQ. Compare the performance now, in bits per original source symbol, with the best possible.
  Fig. 7.1:

Construct a Binary Huffman Code for a Source SSS With Three Symbols

Construct a Binary Huffman Code for a Source $S$ With Three Symbols