Ternary Golay code

In coding theory, the ternary Golay codes are two closely related error-correcting codes. The code generally known simply as the ternary Golay code is an -code, that is, it is a linear code over a ternary alphabet; the relative distance of the code is as large as it possibly can be for a ternary code, and hence, the ternary Golay code is a perfect code. The extended ternary Golay code is a [12, 6, 6] linear code obtained by adding a zero-sum check digit to the [11, 6, 5] code. In finite group theory, the extended ternary Golay code is sometimes referred to as the ternary Golay code. The ternary Golay code consists of 36 = 729 codewords. Its parity check matrix is Any two different codewords differ in at least 5 positions. Every ternary word of length 11 has a Hamming distance of at most 2 from exactly one codeword. The code can also be constructed as the quadratic residue code of length 11 over the finite field F3 (i.e., the Galois Field GF(3) ). Used in a football pool with 11 games, the ternary Golay code corresponds to 729 bets and guarantees exactly one bet with at most 2 wrong outcomes. The set of codewords with Hamming weight 5 is a 3-(11,5,4) design. The generator matrix given by Golay (1949, Table 1.) is The automorphism group of the (original) ternary Golay code is the Mathieu group M11, which is the smallest of the sporadic simple groups. The complete weight enumerator of the extended ternary Golay code is The automorphism group of the extended ternary Golay code is 2.M12, where M12 is the Mathieu group M12. The extended ternary Golay code can be constructed as the span of the rows of a Hadamard matrix of order 12 over the field F3. Consider all codewords of the extended code which have just six nonzero digits. The sets of positions at which these nonzero digits occur form the Steiner system S(5, 6, 12). A generator matrix for the extended ternary Golay code is The corresponding parity check matrix for this generator matrix is , where denotes the transpose of the matrix.