東京大学 情報理工学系研究科 電子情報学専攻 2024年度 専門 第5問
Author
Description
The source \(S\) is a first-order Markov information source outputting \(0\) and \(1\). \(0\) is followed by \(0\) with a probability of \(0.9\) and \(1\) is followed by \(1\) with a probability of \(0.6\). The following may be used. \(\log_23 = 1.58 , \log_25 = 2.32\). For the calculations, two significant digits are sufficient.
(1) Show a state transition diagram of the source \(S\).
(2) Obtain the probability of each \(0\) and \(1\) output from the source \(S\).
(3) Obtain the entropy of the source \(S\).
Assume the following four methods of coding to compress the output symbols of the source \(S\).
a. fixed-length coding of fixed-length symbol sequences
b. variable-length coding of fixed-length symbol sequences
c. fixed-length coding of variable-length symbol sequences
d. variable-length coding of variable-length symbol sequences
Consider the fixed-length symbol sequences as \(00 , 01 , 10\) and \(11\) , and the variable-length symbol sequences as \(000 , 001 , 01 ,\) and \(1\) that are \(0\)'s run lengths up to length \(3\). The variable-length coding is Huffman coding consisting of \(0\) and \(1\).
(4) Obatain the probability of each of the fixed-length symbol sequences of \(00 , 01 , 10 ,\) and \(11\).
(5) In the case b , show the Huffman code and obtain the average code length per symbol of the sources \(S\) .
(6) Obtain the probability of each of the variable-length symbol sequences of \(000 , 001 ,01 ,\) and \(1\).
(7) In the case c , obtain the average code length per symbol of the source \(S\) .
(8) Show the Huffman code for the case d and obtain the average code length per symbol of the source \(S\).
(9) Arrange the methods of a , b , c , and d from the shortest to the longest in terms of the average code length.
Kai
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
d,b,c,a