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
-
EBCDIC
Computer character encoding
Nº Q627945 ★★
Not listed
-
Klein four-group
Direct product of two cyclic groups of order two; smallest group that is non-cyclic
Nº Q550593 ★
Not listed
-
Discrete logarithm
Problem of inverting exponentiation in finite groups
Nº Q864003 ★★
Not listed
-
Gödel metric
Solution of Einstein field equations with a a homogeneous distribution of swirling dust particles and a negative cosmological constant, featuring closed timelike curves
Nº Q1559192 ★★
Not listed
-
4
4,294,967,295
Natural number
Nº Q16143324 ★
Not listed
-
Executable and Linkable Format
Standard file format for executables, object code, shared libraries, and core dumps
Nº Q1343830 ★★★
Not listed
-
Thomson problem
Mathematical problem
Nº Q7795912 ★
Not listed
-
E number
Code for substances that are used as food or animal feed additives
Nº Q207810 ★★★
Not listed
-
8
8b/10b encoding
Line code mapping 8-bit words to 10-bit symbols
Nº Q1755441 ★
Not listed
-
E. Allen Emerson
American computer scientist (1954–2024)
Nº Q92821 ★★
Not listed
-
H
Hahn–Banach theorem
Theorem on extension of bounded linear functionals
Nº Q866116 ★★
Not listed
-
Yuri Manin
Russian mathematician (1937–2023)
Nº Q65196 ★★
Not listed
-
H
Histone code
Patterns of changes made to histones
Nº Q910897 ★
Not listed
-
G
Googolplex
Large number defined as ten to the power of one googol
Nº Q508 ★★★
Not listed
-
Binary relation
Set of ordered pairs with first element in A and second element in B
Nº Q130901 ★★★
Not listed
-
Eric Schmidt
Software engineer, businessman, former Google CEO
Nº Q92747 ★★★★
Not listed
-
Classification of finite simple groups
Theorem
Nº Q1340623 ★★
Not listed
-
Viviani's theorem
Theorem that the sum of the shortest distances from any interior point to the sides of an equilateral triangle equals the length of the triangle's altitude
Nº Q852183 ★
Not listed