Given a MxN 0-1 matrix D, with the property that

- both M and N are odd numbers
- its row sums and column sums in the $\mathbb{Z}_2$ field are all equal to the same number (0 or 1).

How do we find M binary numbers $r_i$ and N binary numbers $c_j$, such that $ \sum r_i = \sum c_j $ and $$ r_i + c_j = D_{ij} $$ is satisfied for as many cell $(i,j)$ as possible? (By the way, the "+" is in the $\mathbb{Z}_2$ field, that is the XOR operation.)

completedecoding algorithm for the code $C$. Need to think about this one ... – Jyrki Lahtonen May 5 '12 at 13:18