Ternary Golay code

Encyclopedia : T : TE : TER : Ternary Golay code

There are two closely related error-correcting codes known as ternary Golay codes. The code generally known simply as the ternary Golay code is a perfect (11, 6, 5) ternary linear 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.

The complete weight enumerator of the extended ternary Golay code is

[x^+y^+z^+22(x^6y^6+y^6z^6+z^6x^6)+220(x^6y^3z^3+y^6z^3x^3+z^6x^3y^3)].

The perfect ternary Golay code can be constructed as the quadratic residue code of length 11 over the finite field F₃.

The automorphism group of the extended ternary Golay code is 2.M₁₂, where M₁₂ is a Mathieu group.

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).

References

J. H. Conway and N. J. A. Sloane. Sphere Packings, Lattices and Groups, Springer-Verlag, New York, Berlin, Heidelberg, 1988.
Griess, Robert L.: "Twelve Sporadic Groups", Springer-Verlag, 1998.

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.