Proofs of Existence and Optimality · Application: Error Correcting Codes (Optional)
Lesson 10
Problem. The parity-check matrix for the code \(C \subseteq \{ 0, 1 \}^{6}\) is defined as follows: \[H = \begin{pmatrix}0 & 1 & 1 & 1 & 0 & 0 \\ 1 & 0 & 1 & 0 & 1 & 0 \\ 1 & 1 & 0 & 0 & 0 & 1\end{pmatrix}\] Enter the following seven values, separated by commas.
- The number \(k\) for this code,
- The number \(d\) for this code,
- The codeword for the message \(011\),
- The message \(m \in \{0,1\}^{3}\) if the codeword is \(010100\) (the code can be corrupted),
- Is this code linear (\(1\) if yes, \(0\) if no),
- Is this code perfect (\(1\) if yes, \(0\) if no),
- Is this code systematic (\(1\) if yes, \(0\) if no).
1 point