申論題

(6) (25%) Consider a discrete memoryless source (DMS) with the associated source alphabet X := {a, b, c, d, e,f, g}. Each source output is independenty selocted from C with the probability distribution Px given in Table 1. The goal of source coding for the DMS is to construct a code C that assigns cach symbol bit stringN. Its average length is defined asMoreover, the code is usually required to be uniquely decodable.   Please answer the following questions.

(c) (10%) Use the Hufiman algorithm to construct a prefix-free code for the above mentioned DMS. What is the associated average length? Clearly state your coding strategy.