Consider the code C = {11100, 01001, 10010, 00111}. (a) Compute the minimum distance of C. (b) Decode the words 10000, 01100, and 00100 using minimum distance decoding. (c) What is the least set of words that should be added to C in order to get a linear code C 0 ? Will the minimum distance change? (d) With C 0 , is 11111 a code-word? If not, can the errors be corrected?

Consider the code C 11100, 01001, 10010, 00111) (a) Compute the minimum distance of C (b) Decode the words 10000, 01100, and 00100 using minimum distance decoding. (c) What is the least set of words that should be added to C in order to get a linear code C"? Will the minimum distance change d) With C', is 11111 a code-word? If not, can the errors be corrected