Encode the source using Huffman algorithm. Find the average code length and efficiency

753views

written 7.9 years ago by

kaveri • 20

modified 3.7 years ago by

sagarkolekar ★ 11k

Consider a DMS $S= (S_(1,) S_2,S_(3………) S_7)$ with following message probabilities.

Si	S1	S2	S3	S4	S5	S6	S7
P(Si)	0.40	0.25	0.15	0.10	0.05	0.03	0.02

Encode the source using Huffman algorithm. Find the average code length and efficiency

digital communication

ADD COMMENT EDIT