Question 7 Consider a systematic binary cyclic code with the generator polynomial g(1) = r +1 (assume the number of inputs is k). (a) Determine if the weight of any codeword in this code is even. Provide the proof. (5 marks) (b) Determine the minimum Hamming distance of this code. Give a proof of your argument. (5 marks) C) Give an implementation as a convolutional encoder with shift-registers. Draw the connections of the shift-registers. (5 marks) Question 7 Consider a systematic binary cyclic code with the generator polynomial g(1) = r +1 (assume the number of inputs is k). (a) Determine if the weight of any codeword in this code is even. Provide the proof. (5 marks) (b) Determine the minimum Hamming distance of this code. Give a proof of your argument. (5 marks) C) Give an implementation as a convolutional encoder with shift-registers. Draw the connections of the shift-registers