Which coding scheme is commonly used for strong burst-error correction in data streams?

Which coding scheme is commonly used for strong burst-error correction in data streams?

• A. Convolutional codes
• B. LDPC codes
• C. Reed-Solomon codes
• D. Hamming codes

Answer: (C)

When bursts of errors dominate, you want a scheme that protects entire blocks of data by correcting multiple symbol errors within each block. Reed-Solomon codes do exactly that by operating on symbols (like bytes) in blocks. For an RS code with parameters (n, k), the minimum distance is d_min = n − k + 1, which means it can correct up to t = floor((d_min − 1)/2) symbol errors in a block. So if a burst corrupts several consecutive bits that fall into a few symbols, the code can recover as long as the number of bad symbols stays within that limit. In practice, interleaving is often used to spread a long burst across many RS blocks, turning a single burst into many smaller symbol errors across blocks, which RS can handle very robustly. That combination—symbol-level protection per block and strong burst resilience—helps explain why Reed-Solomon codes are commonly used for strong burst-error correction in data streams. While other codes have their strengths—convolutional codes for continuous streams, LDPC codes near channel capacity with appropriate interleaving, and Hamming codes for simple single-error scenarios—they aren’t as inherently tuned for correcting long bursts within a single block.

When bursts of errors dominate, you want a scheme that protects entire blocks of data by correcting multiple symbol errors within each block. Reed-Solomon codes do exactly that by operating on symbols (like bytes) in blocks. For an RS code with parameters (n, k), the minimum distance is d_min = n − k + 1, which means it can correct up to t = floor((d_min − 1)/2) symbol errors in a block. So if a burst corrupts several consecutive bits that fall into a few symbols, the code can recover as long as the number of bad symbols stays within that limit. In practice, interleaving is often used to spread a long burst across many RS blocks, turning a single burst into many smaller symbol errors across blocks, which RS can handle very robustly. That combination—symbol-level protection per block and strong burst resilience—helps explain why Reed-Solomon codes are commonly used for strong burst-error correction in data streams. While other codes have their strengths—convolutional codes for continuous streams, LDPC codes near channel capacity with appropriate interleaving, and Hamming codes for simple single-error scenarios—they aren’t as inherently tuned for correcting long bursts within a single block.