Abstract
In this project we give examples of methods described in the Chapters 10 and 11 on finding the minimum weight codewords, the decoding of cyclic codes and working with the Mathieu groups (see also 6). The codes that we use here are the well-known Golay codes. These codes are among the most beautiful objects in coding theory, and we would like to give some reasons why.
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.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
de Boer, M., Pellikaan, R. (1999). The Golay Codes. In: Cohen, A.M., Cuypers, H., Sterk, H. (eds) Some Tapas of Computer Algebra. Algorithms and Computation in Mathematics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03891-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-662-03891-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08335-8
Online ISBN: 978-3-662-03891-8
eBook Packages: Springer Book Archive