Question 0.3. Compute the determinant of the matrix A = 0 1 2 0 3 1 in F5. Does this indicate if the matrix A is invertible or not? Next, give bases for the kernel and image of A over F5. You should find that the image is two dimensional and the kernel is one dimensional. We now discuss error correcting codes. Alice and Bob anticipate that they are going to want to communicate through an unreliable method where some part of the message may be garbled. Precisely, Alice expects that she will want to send one of N possible messages, which she will do using n characters from an alphabet of size p. She is concerned that as many as d - 1 of the characters may be received wrong. She will therefore try to choose N of the possible pr strings, in such a way that no string can be turned into any other by changing fewer than d characters. That is, any d 1 errors should be detectable. For example, take N = 8, p = 2, n = 7. Alice could choose the following 8 codewords to represent the messages she might send: Message Code word 0000000 Hello. 1001101 0101011 1100110 Goodbye. Safe! See you tomorrow. 0010111 It will rain tomorrow. 1011010 The final exam is easy. 0111100 1110001 I will leave soon. Help! Consider the linear space Fr, where the elements are (x1, x2,...,xn) where each x; Є Fp. (It is analogous to Rn.)