Message parity check [closed]

Question

Can someone help me out with implementing this sequence of calculations in C#?

Answer 1

This problem essentially describes a CRC with a 24-bit polynomial.

You can solve the problem simply using shift and XOR operations and a 24-bit (or larger) variable; no bigint required.

Recommended introductory reading:

• http://en.wikipedia.org/wiki/Cyclic_redundancy_check
• http://www.mathpages.com/home/kmath458.htm
• http://www.ross.net/crc/download/crc_v3.txt