Self-checking decoding algorithm for Reed-Solomon codes
The definitions of error secure and self-checking algorithms are given. It is shown that decoding algorithms for Reed-Solomon codes over GF(q) can be transformed in self-checking algorithms for a set F of single algorithmic errors. The two kinds of check functions of error secure decoding algorithms of Reed-Solomon codes are described.
Unable to display preview. Download preview PDF.
- 1.G.R.Redinbo, Fault-tolerant decoders for cyclic error-correcting codes. IEEE Trans. Comput., V. C-36. No. 1, Jan.1987, pp. 47–63.Google Scholar
- 2.J.F.Wakerly, Error Detecting Codes, Self-Checking Circuits and Applications. North-Holland, New York, 1978.Google Scholar
- 3.T.R.N.Rao and E.Fujiwara, Error-control Coding for Computer Systems. Prentice-Hall,. Englewood Cliffs, N.Y.,1989.Google Scholar
- 4.F.J.MacWilliams and N.J.A.Sloane, The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.Google Scholar