Jump to content

Ternary Golay code

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 4pq1injbok (talk | contribs) at 16:28, 3 November 2005 (new stubby article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

.

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

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

References

J. H. Conway and N. J. A. Sloane. Sphere Packings, Lattices and Groups, Springer-Verlag, New York, Berlin, Heidelberg, 1988.