Question: Two different character encoding schemes E 1 and E 2 encode the characters R , G , B , Y as ( 0 , 0

Two different character encoding schemes E1 and E2 encode the characters
R,G,B,Y as (0,011,111,11) and (0,11,101,100) respectively. The string RGRBYRR
is encoded using both the methods, transmitted and decoded at the receiver. Which
of the two have been generated using Huffman tree? Justify your answer

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!