ITPEC FE Morning April 2023 Question 6

CRC (Cyclic Redundancy Check) — error detection using polynomial division.

How it works:
- Sender divides the data bit sequence by a generator polynomial and appends the remainder to the data
- Receiver checks if the received bit sequence is divisible by the same polynomial
- If remainder ≠ 0 → error detected

Why not others:
- (b) Hamming code — error correction method using check bits at power-of-2 positions, not polynomial division
- (c) Horizontal parity check — single parity bit per row/block, no polynomial involved
- (d) Vertical parity check — parity bit per column, no polynomial involved

Key distinction: CRC = polynomial division; Hamming = bit-position-based correction; parity checks = simple even/odd bit counting.

AI-generated — may contain errors