You are not signed in.
To save solutions, earn points and appear on the leaderboard. register or sign in.

Huffman Decoding

Description

A string was compressed using the following Huffman bit code table:

Huffman code table

Symbol Bit Code
[SPACE] 010
c 1010
d 1011
e 00
o 1100
p 011
r 1101
u 100
w 1110
y 1111

 

 

 

 

 

 

 

 

 

 

Notice: Huffman codes are prefix codes. That means any longer code does not start with the bits of a shorter code. For example, no bit code with more than two bits begins with '00', which is the code for 'e'.


Question

What is the decompressed message, if the compressed bits are '11111100100010111000110100010101011001011000101010100011011001011'?

 


What is the decompressed message, if the compressed bits are '11111100100010111000110100010101011001011000101010100011011001011'?