CRC

[reaper]

"
IETF solutions for adopting Jumbo Frames avoids the data integrity reductions through use of the Castagnoli CRC polynomial being implemented within the SCTP transport (RFC 4960), and iSCSI (RFC 3720). Selection of this polynomial was based upon work documented in the paper "32-Bit Cyclic Redundancy Codes for Internet Applications"[2]. The Castagnoli polynomial 0x11EDC6F41 achieves the Hamming Distance HD=6 beyond one Ethernet MTU (to a 16,360 bit data word length) and HD=4 to 114,663 bits, which is more than 9 times the length of an Ethernet MTU. This gives two additional bits of error detection ability at MTU-sized data words compared to the Ethernet CRC standard polynomial while not sacrificing HD=4 capability for data word sizes up to and beyond 72K bits.

"

I thought this was pretty neat because there is some neat math behind the error checking, and you see some technologies coming together.  My understanding of the quote is that the block of data being checked for errors is bigger, so the alogirthm used to verify data is changed accordingly.  If anyone wants to explain this, that would be nice, otherwise I will continue reading the article :p

http://en.wikipedia.org/wiki/Cyclic_redundancy_check

http://en.wikipedia.org/wiki/Jumbo_frame