Question

0

632views

i)Create a Huffman Tree for Huffman source coding technique to find the codeword and length of codewords for each source symbol.

written 6.3 years ago by

kaveri • 20

modified 2.2 years ago by

sagarkolekar ★ 11k

Consider the five source symbols of a discrete memoryless source and their respective probabilities as below.

Si	S1	S2	S3	S4	S5
P(Si)	0.4	0.2	0.2	0.1	0.1

i) Create a Huffman Tree for Huffman source coding technique to find the codeword and length of codewords for each source symbol.

ii) Determine the average codeword length of the specified discrete memoryless source.

iii) Comment on the results obtained.

ADD COMMENT EDIT