A3. Error correcting schemes Linear error correcting codes are characterized entirely by their generator matrix, G, or their parity check matrix, H. a) A linear (5,3)-code has generator matrix [1 0 0 0 0 0 1 G' = 10 1 0 1 0 LO 0 1 1 1. List all the codewords from the code and find its minimum distance. [5] b) Find the corresponding parity check matrix. [3] c) Using the parity check matrix (or otherwise) determine whether the word (1 0 1 0 1)? T is a codeword of this code. [2] C