Hamming Code and Information Theory Quiz

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

• dmin>= s+1

• dmin>= 2s+1

• dmin>= 2s+2

• dmin>= s+2

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

• 2

• 3

• 1

• 0

Hamming distance can easily be found with ...

• XNOR operation

• XOR operation

• OR operation

• AND operation

How does a noise affect the data?

• change only the 0 to 1

• change only the 1 to 0

• change the 0 to 1 and the 1 to 0

• None of the above

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

• 11

• 4

• 15

• 5

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

• 26

• 31

• 5

• 4

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

• 4

• 3

• 7

• 10

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

• 4

• 15

• 11

• 5

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

• 26

• 31

• 5

• 4

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

• 3

• 4

• 7

• 11