Decoding of Reed-Solomon codes for burst correction

V.Yu. Krachkovsky · 2002

A new approach for multiple bursts correction by RS codes is considered. Based on the folded structure of an RS code, it helps to achieve near-optimal burst correction capability, apart from the random error correction. We show that all correctable bursts can be recovered by applying the multi-sequence shift-register synthesis algorithm.

Read the paper · More papers on PaperTik