# Coding

Not what you're looking for? Search our solutions OR ask your own Custom question.

) Assume the following alphabet with eight symbols, where each symbol

has the listed probability of occurrence.

Symbol Probability of

Occurrence

000 .15

001 .1

010 .05

011 .4

100 .025

101 .02

110 .005

111 .25

(a) Assuming that symbols are compressed using Huffman Coding and that the most

likely symbol is encoded as a 0, what is the decompressed value of the following

compressed string of bits? 11011101111001111101111110111111110

(b) For the Huffman Code that corresponds to the alphabet shown in the table above,

what is the average number of bits needed to encode each 3-bit symbol?

https://brainmass.com/computer-science/trees/26560

$2.49