checking crc is easy reduce message by cx make sure

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: sum) –  Flip bits to get checksum (one’s complement) •  Transmit: Data + Checksum •  To check: sum whole packet, including sum, should get 0xffff hnp://www.ier.org/rfc/rfc1071.txt How good is it? •  16 bits not very long –  Probability 1- bit error not detected? •  Checksum does catch any 1- bit error •  But not any 2- bit error –  E.g., increment word ending in 0, decrement one ending in 1 CRC – Error Detec)on with Polynomials •  Consider message to be a polynomial in Z2[x] –  Each bit is one coefficient –  E.g., message 10101001 - > m(x) = x7 + x5+ x3 + 1 •  Can reduce one polynomial modulo another –  Let...
View Full Document

This note was uploaded on 01/27/2014 for the course COSC 4377 taught by Professor Staff during the Spring '08 term at University of Houston.

Ask a homework question - tutors are online