Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
G.R.Redinbo, Fault-tolerant decoders for cyclic error-correcting codes. IEEE Trans. Comput., V. C-36. No. 1, Jan.1987, pp. 47–63.
J.F.Wakerly, Error Detecting Codes, Self-Checking Circuits and Applications. North-Holland, New York, 1978.
T.R.N.Rao and E.Fujiwara, Error-control Coding for Computer Systems. Prentice-Hall,. Englewood Cliffs, N.Y.,1989.
F.J.MacWilliams and N.J.A.Sloane, The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyarinov, I.M. (1994). Self-checking decoding algorithm for Reed-Solomon codes. In: Chmora, A., Wicker, S.B. (eds) Error Control, Cryptology, and Speech Compression. ECCSP 1993. Lecture Notes in Computer Science, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58265-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58265-6
Online ISBN: 978-3-540-48588-9
eBook Packages: Springer Book Archive