Which technique is commonly used to generate a frame-check sequence for error…

Concept

At the data-link layer, error detection adds redundant check information to each frame. The receiver recomputes the check from the received bits and compares the result with the transmitted check value.

A cyclic redundancy check treats the frame bits as a polynomial, divides by an agreed generator polynomial, and uses the remainder as the frame-check sequence.

Application

1. The sender performs modulo-2 polynomial division on the frame bits and appends the resulting CRC remainder.

2. The receiver divides the received bit sequence by the same generator polynomial and examines the remainder.

3. A non-zero remainder signals that the received frame differs from the codeword generated by the sender. Therefore, among the listed choices, cyclic redundancy check (CRC) is the error-detection technique.

Cross-check and contrast

• Hamming codes use parity-bit positions and a syndrome to locate a bit error; their distinguishing feature is error localization and correction.

• Bit stuffing is a framing-transparency rule that prevents payload bits from being mistaken for a delimiter.

• Automatic repeat request (ARQ) is a recovery procedure that retransmits a frame after loss or detected corruption; it does not generate the frame-check sequence.

Result: Cyclic redundancy check (CRC).