Error Detection and Correction: Cyclic Redundancy Check Consider the Cyclic Redundancy Check (CRC) algorithm discussed in Section 5.2.3 of the text. Suppose that the 4-bit generator (G) is 1001, that the data payload (D) is 10011110 and that r=3. What are the CRC bits (R) associated with the data payload of D = 10011110, given that r=3?

[Hint: recall from the text that in calculating the CRC bits, all CRC calculations are done in modulo-2 arithmetic without carries in addition or borrows in subtraction. This means that addition and subtraction are identical and both equal to the bitwise exclusive-OR (XOR) of the operands. If you'd like to review modulo-2 binary arithmetic, here is a nice site that provides a modulo-2 binary arithmetic calculator, and provides explanations of the calculations.]