In defining the Hamming distance for a code. We choose to use the minimum (Hamming) distance between any two encodings. Explain why it would the maximum or average distance. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. How many parity bits are necessary? Assuming we are using the Hamming algorithm ted in this chapter to design our error-correcting code, find the code word to represent the 10-bit information word: 1001 100 110. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. How many parity bits are necessary? Assuming we are using the Hamming algorithm p in this chapter our error correcting code, find the code word to represent the 12-bit information word: 1001 000 l 1010. Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. e have already calculated that need 4 check bits, and the length of code words will be 11.Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word: 101010 11110 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? Repeat exercise 68 using the following code word: 01 11 1010101 70. Suppose we are working with an error-correcting code that will allow all errors to be corrected for memory words of length 12. We have already calculated we need 5 check bits, and the length of all code words will be 17.code words acted according receive the to the Hamming algorithm presented in the text. We now following code word: 01 10010 100 100 1001 Assuming even parity, is this a legal code word? If not, according to correcting code, where is the error? Name two ways in which Reed Solomon coding differs from Hamming coding. When would you choose a CRC code over a Hamming code? A Hamming code over a CRC? In defining the Hamming distance for a code. We choose to use the minimum (Hamming) distance between any two encodings. Explain why it would the maximum or average distance. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. How many parity bits are necessary? Assuming we are using the Hamming algorithm ted in this chapter to design our error-correcting code, find the code word to represent the 10-bit information word: 1001 100 110. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. How many parity bits are necessary? Assuming we are using the Hamming algorithm p in this chapter our error correcting code, find the code word to represent the 12-bit information word: 1001 000 l 1010. Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. e have already calculated that need 4 check bits, and the length of code words will be 11.Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word: 101010 11110 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? Repeat exercise 68 using the following code word: 01 11 1010101 70. Suppose we are working with an error-correcting code that will allow all errors to be corrected for memory words of length 12. We have already calculated we need 5 check bits, and the length of all code words will be 17.code words acted according receive the to the Hamming algorithm presented in the text. We now following code word: 01 10010 100 100 1001 Assuming even parity, is this a legal code word? If not, according to correcting code, where is the error? Name two ways in which Reed Solomon coding differs from Hamming coding. When would you choose a CRC code over a Hamming code? A Hamming code over a CRC