Abstract
AbstractA doubly encoded Reed‐Solomon (RS) code is a code obtained by encoding the RS code twice. In general, doubly encoded codes are derived from some simple codes to achieve high error correctability. Each step of the double decoding can be implemented easier than a single step decoding of codes with long code length which have a comparable error‐correctability. Furthermore, the doubly encoded codes are suitable for correcting both random and burst errors. This paper describes a decoding scheme for doubly encoded RS codes and discusses its performance. Data and facts obtained during the first step of decoding are used in the second step of the decoding. Even though it is difficult to obtain the optimum decoding scheme, this paper describes an algorithm that renders near‐optimum outcomes. Using CIRC as an example, the selection of a decoding scheme and its superior performance compared to that of the existing scheme are demonstrated. Furthermore, equations are presented for the approximations of various decoding performance parameters. These approximations are quite accurate compared to the exact values, and can reduce a considerable amount of computation time.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call