Теория информации #2

The length of the message is 16 symbols and the message’s alphabet consists of 4 symbols. Find the amount of information in this message.

• A) 16

• B) 80

• C) 64

• D) 32

The efficiency of the language is 0,5 and its I average is equal to 1 bit. Calculate the number of letters in this language’s alphabet?

• A) 64

• B) 32

• C) 4

• D) 16

Elements of alphabets X and Y are statistically related. It is known that H(X)=4 bits and H(Y)=10 bits. What are a range of variation for a conditional entropy H(Y|X) when H(X|Y) changes from its min to max?

• A) (from 7 to 11)

• B) (from 4 to 12)

• C) (from 6 to 10)

• D) (from 6 to 11)

For Hamming distance dmin and r errors in the received word, the condition to be able to detect the errors is

• A) dmin>= r+1

• B) dmin>= 2r+1

• C) dmin>= 2r+2

• D) dmin>= r+2

For Hamming distance dmin and s errors in the received word, the condition to be able to correct the errors is

• A) dmin>= s+1

• B) dmin>= 2s+1

• C) dmin>= 2s+2

• D) dmin>= s+2

Hamming (7,4) code can correct ___ error(s)

• A) 2

• B) 3

• C) 1

• D) 0

Hamming distance can easily be found with ...

• A) XNOR operation

• B) XOR operation

• C) OR operation

• D) AND operation

How does a noise affect the data?

• A) change only the 0 to 1

• B) change only the 1 to 0

• C) change the 0 to 1 and the 1 to 0

• D) None of the above

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

• A) 11

• B) 4

• C) 15

• D) 5

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

• A) 26

• B) 31

• C) 5

• D) 4