Need some help with the question.
full solution within the next 10 hours please.
willing to pay 15$ for this.
Thank you!
Let C be the binary linear code generated by the following matrix:
1 0 1 1 1 0 1
1 1 1 0 0 0 0
0 1 1 0 1 1 0
(a) Determine all codewords and the minimum distance between words
in C. Can C locate and correct all single errors? (Prove or give a
counterexample.)
(b) Determine the parity-check matrix for the code (that is, a matrix H
such that for all codewords c E C, HCT = 7).
(c) If x = (1110111) was a received message, decode x to the most
likely codeword, and determine if it is unique.
