There exists a unique
Proof
Construction
From the Golay code
Let
Proof
Let
be a 5-element subset, and assume there exist distinct octads such that . Then which would imply that there exists codeword in
of weight less than 8, a contradiction. Now each octad accounts for
elements, and , which exhausts all 5-element subsets.
Properties
- Let
be a 4-element subset of . Then lies in exactly 5 octads where forms a partition of into 4-element sets called a sextet, and the union of any two sets in a sextet form an octad. - The automorphisms of
are given by Mathieu group M24.