I have attached an image showing a Modulo 2 binary division.
I can roughly understand the working below which is using XOR calculation but I am not sure how the answer (in red) is being computed based on the workings.
I have searched the net and couldn't find any good step by step guide to solve this binary long division.
Hope someone can enlighten me.
Each bit is the highest order bit of what remains so far, right shifted by four places because the dividend has highest term $2^4$. So the first bit is $1$ (as always). Because the first subtraction results in a $0$ in the next column, the second bit of the quotient is $0$. It is just like base $10$ division, if you get a zero in the next column over you put a zero in the quotient and skip it. Try dividing $\frac {100100}{99}$