Related Research Articles
John Horton Conway was an English mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He also made contributions to many branches of recreational mathematics, most notably the invention of the cellular automaton called the Game of Life.
In combinatorial mathematics, a Steiner system is a type of block design, specifically a t-design with λ = 1 and t = 2 or (recently) t ≥ 2.
In mathematics, the Leech lattice is an even unimodular lattice Λ24 in 24-dimensional Euclidean space, which is one of the best models for the kissing number problem. It was discovered by John Leech. It may also have been discovered by Ernst Witt in 1940.
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 introducing them has been called, by E. R. Berlekamp, the "best single published page" in coding theory.
In the area of modern algebra known as group theory, the Conway groups are the three sporadic simple groups Co1, Co2 and Co3 along with the related finite group Co0 introduced by (Conway 1968, 1969).
22 (twenty-two) is the natural number following 21 and preceding 23.
In group theory, a topic in abstract algebra, the Mathieu groups are the five sporadic simple groups M11, M12, M22, M23 and M24 introduced by Mathieu. They are multiply transitive permutation groups on 11, 12, 22, 23 or 24 objects. They are the first sporadic groups to be discovered.
In coding theory, the dual code of a linear code
In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally partitioned into block codes and convolutional codes, although turbo codes can be seen as a hybrid of these two types. Linear codes allow for more efficient encoding and decoding algorithms than other codes.
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 -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.
In coding theory, a cyclic code is a block code, where the circular shifts of each codeword gives another word that belongs to the code. They are error-correcting codes that have algebraic properties that are convenient for efficient error detection and correction.
Many branches of mathematics study objects of a given type and prove a classification theorem. A common theme is that the classification results in a number of series of objects and a finite number of exceptions — often with desirable properties — that do not fit into any series. These are known as exceptional objects. In many cases, these exceptional objects play a further and important role in the subject. Furthermore, the exceptional objects in one branch of mathematics often relate to the exceptional objects in others.
Lexicographic codes or lexicodes are greedily generated error-correcting codes with remarkably good properties. They were produced independently by Vladimir Levenshtein and by John Horton Conway and Neil Sloane. The binary lexicographic codes are linear codes, and include the Hamming codes and the binary Golay codes.
In coding theory, the hexacode is a length 6 linear code of dimension 3 over the Galois field of 4 elements defined by
In the area of modern algebra known as group theory, the Mathieu groupM12 is a sporadic simple group of order
In the area of modern algebra known as group theory, the Mathieu groupM23 is a sporadic simple group of order
In the area of modern algebra known as group theory, the Mathieu groupM24 is a sporadic simple group of order
In the area of modern algebra known as group theory, the Conway groupCo2 is a sporadic simple group of order
In the area of modern algebra known as group theory, the Conway groupCo1 is a sporadic simple group of order
In mathematics, a near polygon is an incidence geometry introduced by Ernest E. Shult and Arthur Yanushka in 1980. Shult and Yanushka showed the connection between the so-called tetrahedrally closed line-systems in Euclidean spaces and a class of point-line geometries which they called near polygons. These structures generalise the notion of generalized polygon as every generalized 2n-gon is a near 2n-gon of a particular kind. Near polygons were extensively studied and connection between them and dual polar spaces was shown in 1980s and early 1990s. Some sporadic simple groups, for example the Hall-Janko group and the Mathieu groups, act as automorphism groups of near polygons.
References
- Conway, John Horton; Sloane, Neil J. A. (1999), Sphere Packings, Lattices and Groups , Grundlehren der Mathematischen Wissenschaften, vol. 290 (3rd ed.), Berlin, New York: Springer-Verlag, ISBN 978-0-387-98585-5, MR 0920369
- Curtis, R. T. (1976), "A new combinatorial approach to M24", Mathematical Proceedings of the Cambridge Philosophical Society, 79 (1): 25–42, doi:10.1017/S0305004100052075, ISSN 0305-0041, MR 0399247