Course contentsShow
← Computer Science
Lesson 1448 of 2,87233. Networking FundamentalsFree lesson

Cyclic Redundancy Check (CRC)

How CRC provides robust error detection through polynomial division over frame data.

Cyclic Redundancy Check (CRC)

You'll learn how CRC uses mathematical polynomial division to catch transmission errors far more reliably than simple parity or checksums.

What Is CRC?

While parity bits and checksums can detect some errors, Cyclic Redundancy Check (CRC) provides industrial-strength error detection by treating your data as a giant polynomial and performing division.

Think of it like this: imagine your data is a long number. Before sending, you divide it by a special "magic number" (the CRC polynomial) and attach the remainder to your message. The receiver does the same division—if they get a different remainder, something went wrong in transit.

How CRC Works

  1. Treat data as a polynomial: Your frame's bits become coefficients. The bit sequence 1101 represents x³ + x² + 1.

  2. Choose a generator polynomial: A standardized polynomial like CRC-32 acts as the divisor. Common standards include CRC-16 and CRC-32.

  3. Append zeros: Add n zeros to your data (where n is the degree of the generator polynomial).

  4. Divide: Perform binary polynomial division (using XOR instead of subtraction).

  5. Attach remainder: The remainder becomes your CRC checksum, replacing those zeros.

  6. Receiver verification: The receiver divides the received frame (data + CRC) by the same generator. If the remainder is zero, the frame is likely error-free.

Why CRC Is Powerful

CRC detects all single-bit errors, all double-bit errors, any odd number of errors, and most burst errors. The polynomial math ensures patterns that fool simple checksums get caught.

Key Takeaway:
CRC uses polynomial division over binary data to generate a powerful checksum that detects virtually all common transmission errors, making it the industry standard for data link layer error detection.