Question: Suppose that in a long bit string the frequency of occurrence of a 0 bit is 0.9 and the frequency of a 1 bit is
a) Construct a Huffman code for the four blocks of two bits, 00, 01, 10, and 11. What is the average number of bits required to encode a bit string using this code?
b) Construct a Huffman code for the eight blocks of three bits. What is the average number of bits required to encode a bit string using this code?
Step by Step Solution
3.55 Rating (169 Votes )
There are 3 Steps involved in it
a The frequencies of the bits strings are 081 for 00 009 for 01 and for 10 and 001 for 11 The result... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
923-M-C-M-S (2567).docx
120 KBs Word File
