Book contents
- Frontmatter
- Contents
- Preface
- 1 Graphs
- 2 Polar spaces
- 3 Graphs related to polar spaces
- 4 Buildings
- 5 Fischer spaces
- 6 Golay codes,Witt designs, and Leech lattice
- 7 Cyclotomic constructions
- 8 Combinatorial constructions
- 9 p-Ranks
- 10 Individual graph descriptions
- 11 Classification of rank 3 graphs
- 12 Parameter table
- References
- Parameter Index
- Author Index
- Subject Index
6 - Golay codes,Witt designs, and Leech lattice
Published online by Cambridge University Press: 06 January 2022
- Frontmatter
- Contents
- Preface
- 1 Graphs
- 2 Polar spaces
- 3 Graphs related to polar spaces
- 4 Buildings
- 5 Fischer spaces
- 6 Golay codes,Witt designs, and Leech lattice
- 7 Cyclotomic constructions
- 8 Combinatorial constructions
- 9 p-Ranks
- 10 Individual graph descriptions
- 11 Classification of rank 3 graphs
- 12 Parameter table
- References
- Parameter Index
- Author Index
- Subject Index
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.
Keywords
- Type
- Chapter
- Information
- Strongly Regular Graphs , pp. 155 - 173Publisher: Cambridge University PressPrint publication year: 2022