pith. sign in

arxiv: 1501.05927 · v2 · pith:XCNYB6DAnew · submitted 2015-01-23 · 💻 cs.IT · math.IT

Multiple-Symbol Interleaved RS Codes and Two-Pass Decoding Algorithm

classification 💻 cs.IT math.IT
keywords correctionerrorburstcodesinterleavedschemealgorithmcapability
0
0 comments X
read the original abstract

For communication systems with heavy burst noise, an optimal Forward Error Correction (FEC) scheme is expected to have a large burst error correction capacity while simultaneously owning moderate random error correction capability. This letter presents a new FEC scheme based on multiple-symbol interleaved Reed-Solomon codes and an associated two-pass decoding algorithm. It is shown that the proposed multi-symbol interleaved coding scheme can achieve nearly twice as much as the burst error correction capability of conventional symbol-interleaved Reed-Solomon codes with the same code length and code rate.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.