Abstract
A class of powerful multiple-error-correcting cyclic codes was discovered by Bose and Ray-Chaudhuri in 1960 [1] and independently by Hocquenghem in 1959 [2]. These codes are known as the BCH codes. The BCH codes provide a wide variety of block lengths and corresponding code rates. They are important not only because of their flexibility in the choice of their code parameters, but also because, at block lengths of a few hundred or less, many of these codes are among the most used codes of the same lengths and code rates. Another advantage is that there exists very elegant and powerful algebraic decoding algorithms for the BCH codes. The importance of the BCH codes also stems from the fact that they are capable of correcting all random patterns of t errors by a decoding algorithm that is both simple and easily realized in a reasonable amount of equipment. BCH codes occupy a prominent place in the theory and practice of multiple-error correction.
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
R. C. Bose and D. K. Ray-Chaudhuri, “On a class of error correcting binary group codes”, Information and Control, 3, pp.68–79, 1960.
A. Hocquenghem, “Codes correcteurs d’erreurs”, Chiffres, 2, pp.147–156, 1959.
D. Gorenstein and N. Zierler, “A class of error correcting code in p m symbols”, Journal of the Society of industrial and applied mathematics, Vol. 9, pp.207–214, June 1961.
W. W. Peterson, “Encoding and error-correction procedures for the Bose-Chaudhuri codes”, IRE Transactions on Information Theory, Vol. IT-6, pp.459–470, Sept. 1960.
R. T. Chien, “Cyclic decoding procedure for the Bose-Chaudhuri-Hocquenghem codes”, IEEE Transactions on Information Theory, Vol. IT-10, pp.357–363, Oct. 1964.
G. D. Forney, “On decoding BCH codes”, IEEE Transactions on Information Theory, Vol. IT-11, pp.549–557, Oct. 1965.
W. W. Peterson and E. J. Weldon, Jr., Error Correcting Codes, 2nd ed. Cambridge, MA. MIT Press, 1972.
F. J. MacWilliam and N. J. A. Sloane, The Theory of Error Correcting Codes, Amsterdam: North-Holland, 1977.
S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications, Englewood Cliffs, NJ: Prentice Hall, 1983.
E. Berlekamp, Algebraic Coding Theory, New York: McGraw-Hill, 1968.
M. Elia, “Algebraic decoding of the (23,12,7) Golay code”, IEEE Trans. Inform. Theory, Vol. IT-33, pp. 150–151, Jan. 1987.
I. S. Reed, X. Yin, and T.K. Truong, “Decoding the (24,12,8) Golay code”, IEE Proc., vol. 137, pt. E. No. 3, pp. 202–206, May 1990.
I. S. Reed, X. Yin, and T. K. Truong, “Algebraic decoding of the (32,16,8) quadratic residue code,” IEEE Transaction on Information Theory, Vol. 36, No.4, pp.876–880, July 1990.
I. S. Reed, T. K. Truong, X. Chen, and X. Yin, “Algebraic decoding of the (41,21,9) quadratic residue code,” IEEE Transaction on Information Theory, Vol. 38, No. 3, pp.974–976, May 1992.
X. Chen, I.S. Reed, T. Helleseth, and T. K. Truong, “General principles for the algebraic decoding of cyclic codes”, IEEE Trans. on Inform. Theory, Vol. 40, No. 5, Sept. 1994.
X. Chen, I.S. Reed, T. Helleseth, and T. K. Truong, “Use of Groebner bases to decode binary cyclic up to the true minimum distance”, IEEE Trans. Inform. Theory, No. 5, Sept. 1994.
X. Chen, I.S.Reed, T. Helleseth, and T. K. Truong, “Algebraic decoding of cyclic codes: a polynomial ideal point of view”, Contemporary Mathematics, Vol. 168, 1994.
M. Y. Rhee, Error Correcting Coding Theory, McGraw-Hill Publishing Company, New York, 1989.
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). BCH 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_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5005-1_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7273-8
Online ISBN: 978-1-4615-5005-1
eBook Packages: Springer Book Archive