Abstract
In December of 1958 I. S. Reed and G. Solomon finished the report, entitled “polynomial codes over certain finite fields” at the M.I.T Lincoln Laboratory [1]. In 1960, a slight modification of this report was published as a paper [2] in the Journal of the Society for Industrial and Applied Mathematics(SIAM). This five-page paper described a new class of error-correcting codes that now are called Reed-Solomon(RS) codes. In the decades since their discovery RS codes have enjoyed countless applications from compact discs and digital television in living rooms to spacecraft and satellites in outer space.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
I.S. Reed and G. Solomon, “Polynomial codes over certain finite fields”, M.I.T. Lincoln Laboratory Group Report 47.23, 31 December 1958.
I.S. Reed and G. Solomon, “Polynomial codes over certain finite fields”, SIAM Journal of Applied Mathematics, Vol. 8, pp.300–304, 1960.
E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill: New York, 1968.
I. S. Reed and G. Solomon, “A decoding procedure for polynomial codes”, M.I.T. Lincoln Laboratory Group Report 47.24, 6 March 1959.
W. W. Peterson, “Encoding and error-correction procedures for Bose-Chaudhuri Codes”, IRE Trans. on Inform. Theory, Vol. IT-6, pp.459–470, Sept. 1960.
D. Gorenstein and N. Zierler, “A class of error correcting codes in p m symbols”, Journal of the Society of Industrial and Applied Mathematics, Vol. 9, pp.207–214, June 1961.
R. T. Chien, “Cyclic decoding procedure for Bose-Chaudhuri-Hocquenghem codes”, IEEE Trans. on Inform. Theory, Vol. IT-10, pp.357–363, Oct. 1964.
G. D. Forney, “On decoding BCH codes”, IEEE Trans. on Inform. Theory, Vol. IT-11, pp.549–557, Oct. 1965.
E. R. Berlekamp, “Nonbinary BCH decoding”, International Symposium on Information Theory, San Remo, Italy, 1967.
J. L. Massey, “Shift register synthesis and BCH decoding”, IEEE Trans. on Inform. Theory, Vol. IT-15, No. 1, pp.122–127, Jan. 1969.
Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “A method for solving key equation for decoding Goppa codes”, Inf. and Contr., 1975, 27, pp.87–99.
G. D. Forney, Jr., Concatenated Codes, Cambridge, MA: MIT Press, 1966.
L. R. Welch and E. R. Berlekamp, “Error Correction for Algebraic Block Codes”, U. S. Patent No. 4,633,470, issued Dec. 30, 1986.
H. M. Shao, T. K. Truong, L. J. Deutsch, J. H. Yuen, and I. S. Reed, “A VLSI Design of a pipeline Reed-Solomon decoder”, IEEE Trans. on Computers, Vol. V-34, pp.393–403, 1985.
H. M. Shao and I. S. Reed, “On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays”, IEEE Trans. on Computers, Vol. C-37, pp.1273–1280, 1988.
C. S. Yeh, I. S. Reed, and T. K. Truong, “Systolic multipliers for finite field”, IEEE Trans. on Computers, Vol. C-33, pp.357–360, 1984.
J. L. Massey and J. K. Omura, “Apparatus for finite field computation”, U. S. Patent Application, pp.21–40, 1984.
M. A. Hasan and V. K. Bhargava, “Bit-serial systolic divider and multiplier for GF(2m)”, IEEE Trans. on Computers, Vol. 41, pp.972–980, August 1992.
E.R. Berlekamp, “Bit-serial Reed-Solomon encoder”, IEEE Trans. on Inform. Theory, Vol. IT-28, No. 6, pp.869–874, Nov. 1982.
R. C. Singleton, “Maximum Distance Q-nary Codes”, IEEE Trans. on Inform. Theory, Vol. IT-10, pp.116–118, 1964.
I. S. Reed, L.J. Deutsch, I.S. Hsu, T.K. Truong, K. Wang, and C. S. Yeh, “The VLSI implementation of a Reed-Solomon encoder using Berlekamp’s bit-serial multiplier algorithm”, IEEE Trans. on Computer, Vol. C-33, No.10, Oct. 1984.
R. E. Blahut, Theory and Practice of Error Control Codes, Reading, Mass.: Addison Wesley, 1984.
T. K. Truong, W. L. Eastman, I. S. Reed, and I. S. Hsu, “Simplified procedure for correcting both errors and erasures Reed-Solomon code using Euclidean algorithm”, IEE Proceedings, Vol. 135, Pt. E, No. 6, Nov. 1988.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Reed, I.S., Chen, X. (1999). Reed-Solomon Codes. In: Error-Control Coding for Data Networks. The Springer International Series in Engineering and Computer Science, vol 508. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5005-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5005-1_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7273-8
Online ISBN: 978-1-4615-5005-1
eBook Packages: Springer Book Archive