Abstract
It is well known that there are exactly five inequivalent doubly-even binary self-dual codes of length 32 and minimum distance 8. The first proof was done by Conway and Pless in 1980. The second proof was given by H. Koch in 1989 by using the balance principle. Both proofs require nontrivial mathematical arguments. In this talk, we give a computer-aided proof of this fact.
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.
References
Bouyukliev, I.: Q-extension, http://www.moi.math.bas.bg/~iliya/Q_ext.htm
Bosma, W., Cannon, J., Playoust, C.: The Magma Algebra System I: The User Language. J. Symbolic Comput. 24, 235–265 (1997)
Conway, J.H., Pless, V.: On the enumeration of self-dual codes. J. Combin. Theory Ser. A 28, 26–53 (1980)
Koch, H.: On self-dual, doubly even codes of length 32. J. Combin. Theory Ser. A 51, 63–76 (1989)
Pless, V.: Introduction to the Theory of Error-Correcting Codes, 3rd edn. J. Wiley and Sons, New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, JL. (2014). Computer Based Reconstruction of Binary Extremal Self-dual Codes of Length 32. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)