After applying Gaussian reduction mod 2, I've ended up with this matrix:
$$\left(\begin{array}{ccccccccc} 1 & 1 & 1 & 1 & 0 & 0 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ \end{array}\right)$$
This seems like it's currently in echelon form. Is it possible to back solve this (using operations mod 2) to get basic variables so that the null space of my original matrix can be found, and if so, how?
My idea: Treat the 7th and 8th columns free variables. Then, starting with the 6th row, simplify each row, bottom to top, until each row is independent of the others.
This seems like it will work, but will a method like that always work for matrices similar to the above?