title: How do you compute the XOR Remainder used in CRC?
body: <p>I'm trying to remember how the math is worked out to compute the remainder of an XOR algorithm in Cyclical Redundancy Checks to verify the remainder bits of a network message.</p>
  
  <p>I shouldn't have tossed that text book.</p>
  
  <p>This is easily done in code, but how is it worked out by hand?</p>
  
  <p>I know it looks something like a standard division algorithm, but I can't remember where to go from there to get the remainder.  </p>
  
  <pre><code>      ___________
  1010 | 101101000
  </code></pre>
  
  <p><strong>Note:</strong> I did google it, but wasn't able to find a place where they mapped the steps in figuring the remainder.</p>