S ( 5 , 8 , 2 4 )
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 𝐶 1 , 𝐶 2 ∈ C . Then 𝑆 ⊆ 𝐶 1 ∩ 𝐶 2 | 𝐶 1 + 𝐶 2 | = | 𝐶 1 | + | 𝐶 2 | − 2 | 𝐶 1 ∩ 𝐶 2 | ≤ 1 6 − 1 0 = 6 which would imply that there exists codeword in
of weight less than 8, a contradiction. C Now each octad accounts for
elements, and ( 8 5 ) = 5 6 , which exhausts all 5-element subsets. 7 5 9 × 5 6 = 4 2 5 0 2 = ( 2 4 5 )
Properties
- Let
be a 4-element subset of𝑇 0 . ThenΩ lies in exactly 5 octads𝑇 0 where{ 𝑇 0 ⨿ 𝑇 𝑖 } 5 𝑖 = 1 forms a partition of{ 𝑇 𝑖 } 5 𝑖 = 0 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.S ( 5 , 8 , 2 4 )