Вопросы по теории информации

16. By the Bayes' theorem ...

• P(B|A) = P(A и B)/P(A)

• P(A|B) = [P(B|A)][P(A)] /P(B)

• P(B|A) = P(A и B)*P(A)

• P(A|B) = [P(B|A)][P(A)] * P(B)

 17. By the Chain rule H(X,Y) = H(Y|X) + ...

• H(X)

• H(Y)

• H(Y|X)

• H(X|Y)

18. By the Hartley's formula the amount of information I = ...

• I = n*log m

• I = m*n

• I = log (m/n)

• I = log (m*n)

19. By the Hartley's formula the entropy H = ...

• H = - ∑(pi*log pi)

• H = - ∑ (log pi)

• H = log m

• H = - ∑ (pi/log pi)

20. By the property of joint entropy H(X,Y) <= ...

• H(X)

• H(Y)

• H(X) + H(Y)

• Ни один из данных

21. By the property of joint entropy H(X,Y) ...

• H(X,Y) >= H(X) и H(X,Y) <= H(Y)

• H(X,Y) <= H(X) и H(X,Y) >= H(Y)

• H(X,Y) >= H(X) и H(X,Y) >= H(Y)

• H(X,Y) >= H(X) + H(Y)

22. By the Shannon's formula the amount of information I = ...

• H = - n * ∑(pi*log pi)

• H = - n * ∑ (log pi)

• H = - n * ∑ pi

• H = - n * ∑ (pi/log pi)

23. By the Shannon's formula the entropy H = ...

• H = - ∑(pi*log pi)

• H = - ∑ (log pi)

• H = - ∑ pi

• H = - ∑ (pi/log pi)

24. Calculate the code rate for Hamming (15,11) code

• 1

• 0,733

• 0,571

• 0,839

25. Calculate the code rate for Hamming (31,26) code

• 1

• 0,839

• 0,733

• 0,571