All Questions
1 question
5
votes
0
answers
155
views
"sparsifying" a binary (over the field F2) matrix
Assume I have a matrix $A \in GF(2)$, i.e., $A_{i,j} \in \{0, 1\}$ and the sum is modulo 2. Is there any known algorithms/methods to sparsify (reduce the number of non-zero entries) $A$ while keeping ...