Consider a (k, n)-code with check matrix A*. Show that if two rows of A* are identical, then this code cannot detect all single-digit errors.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.