Upload to Canvas a PDF of your work for the following problems.
Show (by finding an example), that it is possible to switch two adjacent digits without changing the check digit. (Of course, the adjacent digits in your example should not be equal.)
Compute the code rate for the Two-Dimensional Parity Check code discussed in the notes.
Hereโs an \(8 \times 8\) Hadamard matrix. (See pages 397-398.)
\[ B = \begin{bmatrix} 1 & 1 & 1 & -1 & 1 & -1 & -1 & -1 \\ 1 & 1 & -1 & -1 & -1 & 1 & -1 & 1 \\ 1 & -1 & 1 & 1 & -1 & -1 & -1 & 1 \\ 1 & -1 & 1 & -1 & -1 & 1 & 1 & -1 \\ 1 & -1 & -1 & -1 & 1 & -1 & 1 & 1 \\ 1 & 1 & -1 & 1 & -1 & -1 & 1 & -1 \\ 1 & -1 & -1 & 1 & 1 & 1 & -1 & -1 \\ 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \end{bmatrix} \] Correct the errors in each of the following messages, if possible.