How many check bits are needed if the Hamming error correction code is used to detect single bit errors in a 512-bit data word? Show how you got your answer. (20 points)

Suppose an 8-bit data word stored in memory is 11100011. Using the Hamming algorithm, determine what check bits would be stored in memory with the data word. Show how you got

your answer. (20 points)

For the Hamming code shown in Figure 5.10 show what happens when there is only an error in the second check bit. Show how you got your answer. (20 points)

For the 8-bit word 10111011, the check bits stored with it would be 0011. Suppose when the word is read from memory, the check bits are calculated to be 1001. What is the data word that

was read from memory? Show how you got your answer. (20 points)

Develop an SEC code for a 16-bit data word. Generate the code for the data word 0101000000111001. Show how you got your answer. (20 points)