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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
