1. Assuming each ASCII character is store as a byte (8-bits) WITH THE MOST-SIGNIF BEING USED FOR EVEN-PARITY. What would the string Fienup" be as a sequence of hexadecimal values. (For example, "cab" would be: 6316 El6 E216) 2. The following Hamming codeword contains 8-bits of data (D, to Do), and four (Ps, Pa, P2, and Pi) even-parity bits to allow for one-bit error detection and correction. Determine if an error has occurred and correct it if ssible 10 D7 Do 4+8 1+2+82+8 1+2+4 2+4 1+4 3. Determine the Hamming codeword if the 8-bits of data (D7 to D) are 01 01 1 1 012, i.e., what are the values of the four even-parity bits (Ps, P4, P2, and Pi) to allow for one-bit error detection and correction 10 4+8 1+2+82+8 1+2+42+4 1+4 4. Let D = 101 1001 01 01 1 1 0102 (16-bit data) with G = x5 + x, + 1 is 1001012 (degree 5 polynomial) a) Determine the CRC remainder: 1001 01)1 011 00101011101 0 0.0.0.0.0 append 5 0's since G has 6 bits, so the remainder will have 5 bits b) Determine the codeword sent which is the data appended with the (5-bit) remainder c) Divide the codeword by the generator G-x5 + x2+1 (1001012) to check for an error. Remainder should be zero if no errors d) Introduce some random error into the codeword and check for an error by dividing by the generator G-x x2 +1 (1001012 1. Assuming each ASCII character is store as a byte (8-bits) WITH THE MOST-SIGNIF BEING USED FOR EVEN-PARITY. What would the string Fienup" be as a sequence of hexadecimal values. (For example, "cab" would be: 6316 El6 E216) 2. The following Hamming codeword contains 8-bits of data (D, to Do), and four (Ps, Pa, P2, and Pi) even-parity bits to allow for one-bit error detection and correction. Determine if an error has occurred and correct it if ssible 10 D7 Do 4+8 1+2+82+8 1+2+4 2+4 1+4 3. Determine the Hamming codeword if the 8-bits of data (D7 to D) are 01 01 1 1 012, i.e., what are the values of the four even-parity bits (Ps, P4, P2, and Pi) to allow for one-bit error detection and correction 10 4+8 1+2+82+8 1+2+42+4 1+4 4. Let D = 101 1001 01 01 1 1 0102 (16-bit data) with G = x5 + x, + 1 is 1001012 (degree 5 polynomial) a) Determine the CRC remainder: 1001 01)1 011 00101011101 0 0.0.0.0.0 append 5 0's since G has 6 bits, so the remainder will have 5 bits b) Determine the codeword sent which is the data appended with the (5-bit) remainder c) Divide the codeword by the generator G-x5 + x2+1 (1001012) to check for an error. Remainder should be zero if no errors d) Introduce some random error into the codeword and check for an error by dividing by the generator G-x x2 +1 (1001012