Binary Golay code
Error-correcting code used in digital communications
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 deep connection to the theory of finite sporadic groups in mathematics.
Nº Q1534522 ★
Common · Knowledge
Binary Golay code
Error-correcting code used in digital communications
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 deep connection to the theory of finite sporadic groups in mathematics.
From Wikipedia
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 deep 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. 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 coding 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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Life of Riley (Public domain) ·
Related cards
-
Bernstein–Vazirani algorithm
Quantum algorithm
Nº Q65053013 ★
Not listed
-
F
Fibonacci coding
Universal code
Nº Q2633 ★★
Not listed
-
S
Shor's algorithm
Quantum algorithm for integer factorization
Nº Q940334 ★★★
Not listed
-
V
Von Neumann–Bernays–Gödel set theory
Axiomatic set theory
Nº Q278770 ★
Not listed
-
Euler's theorem in geometry
Theorem describing distance between circumcentre and incentre of a triangle
Nº Q1423818 ★
Not listed
-
M
Menger's theorem
Theorem characterizing graph connectivity by disjoint paths
Nº Q928813 ★
Not listed
-
L
Logic Theorist
Computer program
Nº Q4391896 ★★
Not listed
-
T
Two's complement
Operation on binary numbers, and number representation based on this operation
Nº Q232577 ★★★
Not listed
-
Bi-quinary coded decimal
Numeral encoding scheme
Nº Q864961 ★
Not listed
-
Eclipsing binary star
Binary system in which the orbit plane of the two stars lies so nearly in the line of sight of the observer that the components undergo mutual eclipses
Nº Q1457376 ★
Not listed
-
Linear congruential generator
Pseudorandom number generator
Nº Q1190228 ★★
Not listed
-
CORDIC
Algorithm for computing trigonometric and hyperbolic functions
Nº Q116076 ★★
Not listed
-
L
Leading zero
Any 0 digit that comes before the first nonzero digit in a number string in positional notation
Nº Q1481389 ★
Not listed
-
Z
Zohar Manna
American-Israeli computer scientist
Nº Q92814 ★★
Not listed
-
Holland Codes
Theory
Nº Q1512242 ★★
Not listed
-
Binary system
System of two astronomical bodies which orbit each other
Nº Q978297 ★
Not listed
-
Codomain
Target set of a mathematical function, superset of image
Nº Q199006 ★★
Not listed
-
B
Binet’s theorem
Nº Q3983995 ★
Not listed