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.

Properties

Ternary Golay code

The ternary Golay code consists of 3^6=729 codewords. Its parity check matrix is:egin{bmatrix}11122010000\11210201000\12101200100\12012100010\10221100001end{bmatrix}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.

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.

Extended ternary Golay code

The complete weight enumerator of the extended ternary Golay code is:x^{12}+y^{12}+z^{12}+22left(x^6y^6+y^6z^6+z^6x^6 ight)+220left(x^6y^3z^3+y^6z^3x^3+z^6x^3y^3 ight).

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

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

History

The ternary Golay code has been constructed by Marcel J. E. Golay. He published it in a very short correspondence in 1949.Independently and slightly earlier the same code had also been developed by the Finnish football pool enthusiast Juhani Virtakallio who published it in 1947.

See also

* Binary Golay code

References

* M.J.E. Golay, Notes on digital coding, "Proceedings of the I.R.E." 37 (1949) 657
* I.F. Blake (ed.), "Algebraic Coding Theory: History and Development", Dowden, Hutchinson & Ross, Stroudsburg 1973
* J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer, New York, Berlin, Heidelberg, 1988.
* Robert L. Griess, "Twelve Sporadic Groups", Springer, 1998.
* G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, "Covering Codes", Elsevier (1997) ISBN 0-444-82511-8
* Th. M. Thompson, "From Error Correcting Codes through Sphere Packings to Simple Groups", The Mathematical Association of America 1983, ISBN 0-88385-037-0


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Golay code — may refer to:* Binary Golay code * Ternary Golay code …   Wikipedia

  • Binary Golay code — In mathematics and computer science, a binary Golay code is a type of error correcting code used in digital communications. The binary Golay code, along with the ternary Golay code, has a particularly deep and interesting connection to the theory …   Wikipedia

  • Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples …   Wikipedia

  • Quadratic residue code — A quadratic residue code is a type of cyclic code.There is a quadratic residue code of length pover the finite field GF(l) whenever pand l are primes, p is odd andl is a quadratic residue modulo p.Its generator polynomial as a cyclic code is… …   Wikipedia

  • Linear code — In mathematics and information theory, a linear code is an important type of block code used in error correction and detection schemes. Linear codes allow for more efficient encoding and decoding algorithms than other codes (cf. syndrome… …   Wikipedia

  • Leech lattice — In mathematics, the Leech lattice is an even unimodular lattice Λ24 in 24 dimensional Euclidean space E24 found by John Leech (1967). Contents 1 History 2 Characterization 3 Properties …   Wikipedia

  • Miracle Octad Generator — In mathematics, the Miracle Octad Generator, or MOG, is a mathematical tool introduced by Curtis (1976) for manipulating the Mathieu groups, binary Golay code and Leech lattice. Contents 1 Description 2 Golay code 3 MiniMOG …   Wikipedia

  • Complementary sequences — For complementary sequences in biology, see complementarity (molecular biology). In applied mathematics, complementary sequences (CS) are pairs of sequences with the useful property that their out of phase aperiodic autocorrelation coefficients… …   Wikipedia

  • Троичные алгоритмы — Троичные алгоритмы  алгоритмы, в которых применяется деление или умножение на 3 или на 3 в степени n и применяется троичная логика анализа результата. Хорошо подходят для реализации на троичных компьютерах, при эмуляции на двоичных… …   Википедия

  • List of mathematics articles (T) — NOTOC T T duality T group T group (mathematics) T integration T norm T norm fuzzy logics T schema T square (fractal) T symmetry T table T theory T.C. Mits T1 space Table of bases Table of Clebsch Gordan coefficients Table of divisors Table of Lie …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”