Binary Golay code
|Extended binary Golay code|
Its generator matrix
|Named after||Marcel J. E. Golay|
|Type||Linear block code|
|Rate||12/24 = 0.5|
|Perfect binary Golay code|
|Named after||Marcel J. E. Golay|
|Type||Linear block code|
|Rate||12/23 ~ 0.522|
In mathematics and electronics engineering, a binary Golay code is a type of linear 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 of finite sporadic groups in mathematics. These codes are named in honor of Marcel J. E. Golay whose 1949 paper (Golay (1949)) introducing them has been called, by E. R. Berlekamp, the "best single published page" in coding theory.
There are two closely related binary Golay codes. The extended binary Golay code, G24 (sometimes just called the "Golay code" in finite group theory) encodes 12 bits of data in a 24-bit word in such a way that any 3-bit errors can be corrected or any 7-bit errors can be detected. The other, the perfect binary Golay code, G23, has codewords of length 23 and is obtained from the extended binary Golay code by deleting one coordinate position (conversely, the extended binary Golay code is obtained from the perfect binary Golay code by adding a parity bit). In standard code notation the codes have parameters [24, 12, 8] and [23, 12, 7], corresponding to the length of the codewords, the dimension of the code, and the minimum Hamming distance between two codewords, respectively.
In mathematical terms, the extended binary Golay code, G24 consists of a 12-dimensional subspace W of the space V=F224 of 24-bit words such that any two distinct elements of W differ in at least eight coordinates. By linearity, the distance statement is equivalent to any non-zero element of W having at least eight non-zero coordinates.
- The possible sets of non-zero coordinates as w ranges over W are called code words. In the extended binary Golay code, all code words have the Hamming weights of 0, 8, 12, 16, or 24.
- Up to relabeling coordinates, W is unique.
The perfect binary Golay code, G23 is a perfect code. That is, the spheres of radius three around code words form a partition of the vector space.
The automorphism group of the perfect binary Golay code, G23, is the Mathieu group . The automorphism group of the extended binary Golay code is the Mathieu group . The other Mathieu groups occur as stabilizers of one or several elements of W.
- Lexicographic code: Order the vectors in V lexicographically (i.e., interpret them as unsigned 24-bit binary integers and take the usual ordering). Starting with w1 = 0, define w2, w3, ..., w12 by the rule that wn is the smallest integer which differs from all linear combinations of previous elements in at least eight coordinates. Then W can be defined as the span of w1, ..., w12.
- Quadratic residue code: Consider the set N of quadratic non-residues (mod 23). This is an 11-element subset of the cyclic group Z/23Z. Consider the translates t+N of this subset. Augment each translate to a 12-element set St by adding an element ∞. Then labeling the basis elements of V by 0, 1, 2, ..., 22, ∞, W can be defined as the span of the words St together with the word consisting of all basis vectors. (The perfect code is obtained by leaving out ∞.)
- As a Cyclic code: The perfect G23 code can be constructed via the factorization of over the binary field GF(2):
- It is the code generated by . Either of degree 11 irreducible factors can be used to generate the code.
- Turyn's construction of 1967, "A Simple Construction of the Binary Golay Code," that starts from the Hamming code of length 8 and does not use the quadratic residues mod 23.
- From the Steiner System S(5,8,24), consisting of 759 subsets of a 24-set. If one interprets the support of each subset as a 0-1-codeword of length 24 (with Hamming-weight 8), these are the "octads" in the binary Golay code. The entire Golay code can be obtained by repeatedly taking the symmetric differences of subsets, i.e. binary addition. An easier way to write down the Steiner system resp. the octads is the Miracle Octad Generator of R. T. Curtis, that uses a particular 1:1-correspondence between the 35 partitions of an 8-set and the 35 partitions of the finite vector space into 4 planes.  Nowadays often the compact approach of Conway's hexacode, that uses a 4×6 array of square cells, is used.
- Winning positions in the mathematical game of Mogul: a position in Mogul is a row of 24 coins. Each turn consists of flipping from one to seven coins such that the leftmost of the flipped coins goes from head to tail. The losing positions are those with no legal move. If heads are interpreted as 1 and tails as 0 then moving to a codeword from the extended binary Golay code guarantees it will be possible to force a win.
- A generator matrix for the binary Golay code is I A, where I is the 12×12 identity matrix, and A is the complement of the adjacency matrix of the icosahedron.
Practical applications of Golay codes
NASA deep space missions
- Color image transmission required three times the amount of data as black and white images, so the Hadamard code that was used to transmit the black and white images was switched to the Golay (24,12,8) code. 
- This Golay code is only triple-error correcting, but it could be transmitted at a much higher data rate than the Hadamard code that was used during the Mariner mission.
- The Extended (24,12) Golay Code specified is a (24,12) block code.
- This code encodes 12 data bits to produce 24-bit code words.
- It is furthermore a systematic code, meaning that the 12 data bits are present in unchanged form in the code word.
The minimum Hamming distance between any two code words (the number of bits by which any pair of code words differs) is eight.
- Curtis, R. T. (1976). "A new combinatorial approach to M24". Mathematical Proceedings of the Cambridge Philosophical Society 79: 25–42. doi:10.1017/S0305004100052075.
- Golay, Marcel J. E. (1949). "Notes on Digital Coding". Proc. IRE 37: 657.
- Greferath, Marcus (2003). "Golay Codes". In Proakis, John G. Encyclopedia of Telecommunications. Wiley. doi:10.1002/0471219282.
- Griess, Robert L. (1998). Twelve Sporadic Groups. Springer. p. 167. ISBN 978-3-540-62778-4.
- Pless, Vera (1998), Introduction to the Theory of Error-Correcting Codes (3rd ed.), John Wiley & Sons, ISBN 978-0-471-19047-9
- Roman, Steven (1996), Coding and Information Theory, Graduate Texts in Mathematics #134, Springer-Verlag, ISBN 0-387-97812-7
- Thompson, Thomas M. (1983). From Error Correcting Codes through Sphere Packings to Simple Groups. Carus Mathematical Monographs 21. Mathematical Association of America. ISBN 978-0-88385-023-7.
- Turyn, Richard J., et al. (1967). Research to Develop the Algebraic Theory of Codes (Section VI) (Report). Air Force Cambridge Research Laboratories. http://www.dtic.mil/dtic/tr/fulltext/u2/656783.pdf.