Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 6 - Golay codes,Witt designs, and Leech lattice

  • Andries E. Brouwer, Technische Universiteit Eindhoven, The Netherlands, H. Van Maldeghem, Universiteit Gent, Belgium
  • Book:
    Strongly Regular Graphs
    Published online:
    06 January 2022
    Print publication:
    13 January 2022, pp 155-173

  • Summary

    In this chapter we construct the Golay codes and the Witt designs, both in several ways. The uniqueness is proved in a self-contained way for the binary case; in the ternary case some details are left out. We then study the associated Witt designs, which are remarkable Steiner systems on 12 and 24 points. We show uniqueness of these, and of the (multiply) derived designs. We define the two standard near polygonsfrom the ternary Golay code and the large Witt design. We discuss the geometry of the projective plane of order 4 providing an alternative construction and uniqueness proof of the Witt designs. Finally, we introduce the Leech lattice and its binary and complex variants.