Which code is widely used to protect data by encoding symbols over larger alphabets, enabling robust burst error correction?

Which code is widely used to protect data by encoding symbols over larger alphabets, enabling robust burst error correction?

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

Answer: (B)

Reed-Solomon codes are designed to protect data by operating on symbols taken from a finite, larger alphabet rather than individual bits. This lets data be treated as groups of bits (symbols), so a burst of errors that corrupts several consecutive bits can still appear as only a few symbol errors. Since an RS block can correct a specified number of symbol errors, spreading a long burst across many symbols—often with interleaving used in practice—keeps the number of erroneous symbols within the code’s correction capability, enabling robust recovery of the original data. That makes RS codes especially well suited for burst error environments found in storage media (like CDs, DVDs, and QR codes) and various communications systems. In contrast, Hamming codes are binary and mainly handle single-bit errors, not bursts. Convolutional codes operate on streams and don’t inherently rely on a larger-symbol alphabet for burst correction, though they are powerful for sequential data with different decoding strategies. The Shannon limit is a theoretical bound, not a practical coding scheme.

Reed-Solomon codes are designed to protect data by operating on symbols taken from a finite, larger alphabet rather than individual bits. This lets data be treated as groups of bits (symbols), so a burst of errors that corrupts several consecutive bits can still appear as only a few symbol errors. Since an RS block can correct a specified number of symbol errors, spreading a long burst across many symbols—often with interleaving used in practice—keeps the number of erroneous symbols within the code’s correction capability, enabling robust recovery of the original data. That makes RS codes especially well suited for burst error environments found in storage media (like CDs, DVDs, and QR codes) and various communications systems.

In contrast, Hamming codes are binary and mainly handle single-bit errors, not bursts. Convolutional codes operate on streams and don’t inherently rely on a larger-symbol alphabet for burst correction, though they are powerful for sequential data with different decoding strategies. The Shannon limit is a theoretical bound, not a practical coding scheme.