Which error correction code is widely used in data storage and communications because of its strong burst error correction capability?

Which error correction code is widely used in data storage and communications because of its strong burst error correction capability?

• A. Hamming code
• B. Reed-Solomon code
• C. Convolutional code
• D. Shannon limit

Answer: (B)

Reed-Solomon codes protect data by encoding blocks as polynomials over a finite field, adding parity symbols that let you recover the original symbols even if several are corrupted. In practice, data is treated as symbols (usually bytes), so a burst of errors in the stream often touches consecutive bits but only a limited number of symbols within a codeword. As long as the number of erroneous symbols stays within the codeword’s correction capacity, the original data can be fully recovered. This makes RS codes particularly effective against burst errors, which are common in storage media (scratches on discs, bad sectors) and in communication links that experience impulse noise. Because of this strong burst-error resilience, RS codes are widely used in data storage and communications systems, including CDs, DVDs, Blu-ray discs, RAID configurations, and even QR codes. Hamming codes are designed for correcting single-bit errors in small blocks and aren’t optimized for bursts. Convolutional codes excel in streaming scenarios and can handle bursts with interleaving, but their burst-correction strengths come from a combination of coding and decoding strategies rather than the straightforward block-based burst correction that RS codes provide. The Shannon limit is a theoretical bound, not a practical error-correcting code.

Reed-Solomon codes protect data by encoding blocks as polynomials over a finite field, adding parity symbols that let you recover the original symbols even if several are corrupted. In practice, data is treated as symbols (usually bytes), so a burst of errors in the stream often touches consecutive bits but only a limited number of symbols within a codeword. As long as the number of erroneous symbols stays within the codeword’s correction capacity, the original data can be fully recovered. This makes RS codes particularly effective against burst errors, which are common in storage media (scratches on discs, bad sectors) and in communication links that experience impulse noise. Because of this strong burst-error resilience, RS codes are widely used in data storage and communications systems, including CDs, DVDs, Blu-ray discs, RAID configurations, and even QR codes.

Hamming codes are designed for correcting single-bit errors in small blocks and aren’t optimized for bursts. Convolutional codes excel in streaming scenarios and can handle bursts with interleaving, but their burst-correction strengths come from a combination of coding and decoding strategies rather than the straightforward block-based burst correction that RS codes provide. The Shannon limit is a theoretical bound, not a practical error-correcting code.