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 [ 11 , 6 , 5 ] 3 {\displaystyle [11,6,5]_{3}} -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.
Properties
Ternary Golay code The ternary Golay code consists of 36 = 729 codewords. Its parity check matrix is
[ 2 2 2 1 1 0 1 0 0 0 0 2 2 1 2 0 1 0 1 0 0 0 2 1 2 0 2 1 0 0 1 0 0 2 1 0 2 1 2 0 0 0 1 0 2 0 1 1 2 2 0 0 0 0 1 ] . {\displaystyle \left[{\begin{array}{cccccc|ccccc}2&2&2&1&1&0&1&0&0&0&0\\2&2&1&2&0&1&0&1&0&0&0\\2&1&2&0&2&1&0&0&1&0&0\\2&1&0&2&1&2&0&0&0&1&0\\2&0&1&1&2&2&0&0&0&0&1\end{array}}\right].}
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
… excerpt ends here. Continue reading the full article.
