Abstract
Reed-Solomon codes and BCH codes of large blocklength and large alphabet size are coming into widespread use in communication and storage systems. Secure communication systems commonly use a Reed-Solomon code as one method of jam protection. The importance of these codes is partly due to their superior error-correcting performance, but it is equally due to the availability of efficient decoding algorithms for them. Future requirements will exist for ever-larger error-control codes, but only if the decoding cost remains affordable. It is important to reduce the complexity of the decoding algorithms. These lectures explore the complexity of such algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cooley, J.W. and J.W. Tukey, “An Algorithm for the Machine Computation of Complex Fourier Series,” Math. Comp. Vol. 19, pp. 297–301, 1965.
Good, I.J., “The Interaction Algorithm and Practical Fourier Analysis,” J. Royal Statist. Soc., Ser. B Vol$120, pp. 361–375, 1958; addendum, Vol. 22, pp. 372–375, 1960.
Thomas, L.H., “Using a Computer to Solve Problems in Physics,” in Applications of Digital Computers, Boston, Mass., Ginn and Co., 1963.
Justesen, J., “On the Complexity of Decoding Reed-Solomon Codes,: IEEE Trans. on Information Theory, Vol. IT-22, pp. 237–238, 1976.
Sarwate, D.V., “On the Compexity of Decoding Goppa Codes,” IEEE Trans. on Information Theory Vol. IT-23, pp. 515–516, 1977.
Agarwal, R., and J.W. Cooley, “Algorithms for Digital Convolution,” IEEE Trans. on Acoustics, Speech and Signal Processing, Vol. ASSP-25, pp. 392–410, 1977.
Winograd, S., “On Computing the Discrete Fourier Transform,” Math. Comp. Vol. 32, pp. 175–199, 1978.
Nussbaumer, H.J. Fast Fourier Transform and Convolution Algorithms Springer Verlag, Berlin, 1981.
Miller, R.L., T.K. Truong, and I.S. Reed, “Efficieng Program for Decoding the (255, 223) Reed-Solomon Code Over GF(2) with Both Errors and Erasures, Using Transform Decoding,” IEEE Proceedings, Volume 127, pp. 136–142, 1980.
Blahut, R.E., “Efficient Decoder Algorithms Based on Spectral Techniques,” IEEE Abstracts of Papers - IEEE International Symposium on Information Theory, Santa Monica, California, 1981.
Preparata, F.P., and D.V. Sarwate, “Computational Complexity of Fourier Transforms over Finite Field,” Mathematics of Computation, Vol. 31, pp. 740–751, 1977.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Wien
About this chapter
Cite this chapter
Blahut, R.E. (1983). Fast Decoding Algorithms for Reed-Solomon Codes. In: Longo, G. (eds) Secure Digital Communications. International Centre for Mechanical Sciences, vol 279. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2640-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2640-0_11
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81784-1
Online ISBN: 978-3-7091-2640-0
eBook Packages: Springer Book Archive