Codification and decodification Let C be the linear code of length 9 whose control matrix is

a) Find the dimension of C; b) Find the minimum distance from C; (c) Calculate the s'ndromes corresponding to errors that C can correct; d) Say whether 000110011 C or not. e) Decode 110101101

explain step by step the answer as I know the answers are

a. 9 is the dimension of C

b. 1 is the minimum distance from C

c. 21, sindromes corresponding to errors that C can correct

d. Yes, We can decode.

e. 429

H= 0 1 0 0 1 1 0 0 0 0 0 1 1 1 1 0 0 0 1 0 C 0 1 1 1 1 0 0 0 1 0 C 1 1 1 0 1 0 0 0 1 H= 0 1 0 0 1 1 0 0 0 0 0 1 1 1 1 0 0 0 1 0 C 0 1 1 1 1 0 0 0 1 0 C 1 1 1 0 1 0 0 0 1