Draw Minimum variance Huffman tree for the following alphabet with given set of probabilities.

3.6kviews

written 9.4 years ago by

teamques10 ★ 70k

modified 3.8 years ago by

pedsangini276 • 4.8k

Find average length coding efficiency and variance of the code $P (a_1) = 0.2, P (a_2) = 0.4, P (a_3)= 0.2, P (a_4 ) = 0.1, P (a_5) = 0.1.$ - Mumbai University > EXTC > Sem 7 > Data Compression and Encryption

Marks: 10 M

Year: May 2014

data compression and encryption

ADD COMMENT EDIT

1 Answer

12views

written 9.4 years ago by

teamques10 ★ 70k

1) Minimum variance

Character	Probability	Codeword
$a_1$	0.4	00
$a_2$	0.2	10
$a_3$	0.2	11
$a_4$	0.1	010
$a_5$	0.1	011

Entropy $(H ) =_n (log_2 ( 1 / P_n)) \\ H = 2.122 bits/ Symbol$
Average Length $(L ) = _n . l_n \\ L = 2.2 bits/ Symbol$ …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.