$(1$ point$)$ Recall the simple code from Example $9\mathrm{.}52$:

Encode the message $11111100$ using this code.

Answer:

Decode the message $10100010110100000000,$ which was encoded with the above code and contains up to $1$ error per

code word.

Answer:$(1$ point$)$ Recall the simple code from Example $9\mathrm{.}52$: $1$ point$)$ Consider a linear code with generator matrix

$G=\left[\begin{array}{ccc}1& 1& 0\\ 1& 0& 1\\ 0& 1& 1\\ 1& 0& 0\\ 0& 1& 0\\ 0& 0& 1\\ 0& 0& 0\end{array}\right].$

Encode the message $011001111101$ using this code.

Answer:

Encode the message $11111100$ using this code.

Answer:

Decode the message $10100010110100000000,$ which was encoded with the above code and contains up to $1$ error per

code word.

Answer: