• edited by
3,602 views
1 1 vote
A zero memory source emits six messages with probabilities 0.3, 0.25, 0.15, 0.12, 0.1 and 0.08. If binary Huffman coding is used, what will be the average code length?

a) 2.45 bits

b) 3.45 bits

c) 2.54 bits

d) 3.54 bits

1 Answer

Best answer
3 3 votes

The Huffman tree looks like this. Then for message with probability 0.08 , it takes 3 bits, similarly multiply all the probabilities with the number of bits that respective message would take and summ them all up, so we get 2.45

• selected by
Position:
Show:

Related questions

2 2 votes
1 1 answer
23.5k
23.5k views
piyushkr asked Jan 5, 2016
23,530 views
A file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code leng...
0 0 votes
2 answers 2 answers
560
560 views
Dknights asked Jan 3, 2025
560 views
can someone please explain if the following queries are the same?1- Average length of the Huffman code2- Expected length of the encoded message3- What is the minimum leng...
1 1 vote
0 0 answers
1.7k
1.7k views
sunil sarode asked Dec 28, 2017
1,749 views
RavindraBabu Ravula is trying to send a message to Anand. The following message is: GATE2018GAATTTEEEE22000011188What is the average length of bits required for encoding ...
0 0 votes
1 1 answer
8.1k
8.1k views
aaru14 asked Dec 2, 2017
8,147 views
question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1...