ТЭЦ вопросы2

81. How does a noise affect the data?

82. How many data bits are in the (15, 11) Hamming code?

83. How many data bits are in the (31, 26) Hamming code?

84. How many data bits are in the (7, 4) Hamming code?

85. How many parity bits are in the (15, 11) Hamming code?

86. How many parity bits are in the (31, 26) Hamming code?

87. How many parity bits are in the (7, 4) Hamming code?

88. A Huffman code is a = 0, b = 10, c = 110, d = 1110, e = 1111. Probabilities are p(a) = 0.50, p(b) = 0.30, p(c) = 0.15, p(d) = 0.03, p(e) = 0.02. The average length of a code words is

89. Which letter will get the shortest codeword after Huffman coding of the word «bbaacccabaac»?

90. An alphabet consist of the letters a, b, c, d, e and f. The probability of occurrence is p(a) = 0.06, p(b) = 0.15, p(c) = 0.4 and p(d) = 0.18, p(e)=0.17, p(f)=0.04. The Huffman code is