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
-
Rule 30
One-dimensional cellular automaton rule with chaotic behavior
Nº Q2918510 ★★
Not listed
-
Law of the iterated logarithm
Theorem
Nº Q198740 ★
Not listed
-
Binomial coefficient
Family of positive integers that occur as coefficients in the binomial theorem
Nº Q209875 ★★★★
Not listed
-
Bernoulli's inequality
Inequality that (1+x)ⁿ ≥ 1+nx for x ≥ −1 and n∈ℕ
Nº Q728662 ★★
Not listed
-
Code Pink
American non-governmental organization
Nº Q912387 ★★
Not listed
-
Mathematics Genealogy Project
Web-based database for the academic genealogy of mathematicians
Nº Q829984 ★★
Not listed
-
C
Computer number format
Internal representation of numeric values in a digital computer
Nº Q110427073 ★
Not listed
-
T
Turing completeness
Ability of a computing system to simulate Turing machines
Nº Q197970 ★★★
Not listed
-
H
Hungarian notation
Identifier naming notation (computer science)
Nº Q903244 ★★★
Not listed
-
Error detection and correction
Techniques that enable reliable delivery of digital data over unreliable communication channels
Nº Q1062839 ★★
Not listed
-
Fork (software development)
New program, and line of software development, derived from an existing one
Nº Q332903 ★★★
Not listed
-
Gödel's completeness theorem
Fundamental theorem in mathematical logic
Nº Q902052 ★★
Not listed
-
S
SNOBOL4
Programming language tailored to complex pattern matching and text manipulation
Nº Q121288716 ★
Not listed
-
C
Co-NP
Complexity class
Nº Q955748 ★
Not listed
-
E
ER = EPR
Conjencture unifying entanglement and wormholes
Nº Q19597107 ★
Not listed
-
EEPROM
Nonvolatile memory comprising arrays of floating-gate transistors used in computers and microcontrollers to store relatively small amounts of data but allowing individual bytes to be erased/reprogrammed in-circuit through special programming signals
Nº Q205908 ★★★
Not listed
-
A
A New Kind of Science
Non-fiction work by Stephen Wolfram
Nº Q2987018 ★★
Not listed
-
S
Second-order arithmetic
Mathematical system
Nº Q7442973 ★
Not listed