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
-
Unary numeral system
The simplest numeral system, a non-positional numeral system
Nº Q724775 ★★
Not listed
-
C
CodeIgniter
PHP framework
Nº Q339829 ★
Not listed
-
I
Introduction to Algorithms
Book on computer programming
Nº Q1141518 ★★
Not listed
-
Harald Helfgott
Peruvian mathematician
Nº Q5653809 ★★★
Not listed
-
Andrew S. Tanenbaum
American-Dutch computer scientist
Nº Q92621 ★★★
Not listed
-
S
Software Engineering Body of Knowledge
International standard specifying a guide to the generally accepted Software Engineering Body of Knowledge
Nº Q2164287 ★
Not listed
-
C
Chebotarev density theorem
Theorem
Nº Q1425529 ★
Not listed
-
Bernoulli's principle
Principle relating to fluid dynamics
Nº Q181328 ★★★★
Not listed
-
Kirchhoff's circuit laws
Relations between currents and voltages on sections of any electrical circuit
Nº Q187672 ★★★★
Not listed
-
Clóvis Caesar Gonzaga
Ph.D. Universidade Federal do Rio de Janeiro 1973
Nº Q48868213 ★
Not listed
-
Weber–Fechner law
Psychophysics law that the minimum perceptible increase of stimulus is proportional to the stimulus and that intensity of our sensation increases logarithmically
Nº Q835216 ★★
Not listed
-
G
Gödel machine
Hypothetical self-improving program
Nº Q5626452 ★
Not listed
-
Considered harmful
Phrase used in titles of diatribes and other critical essays
Nº Q840919 ★
Not listed
-
B
Beta Code
ASCII representation format for ancient Greek
Nº Q752325 ★
Not listed
-
EBPF
Sandbox technology within the Linux kernel
Nº Q116197108 ★★
Not listed
-
DPLL algorithm
Algorithm for solving the CNF-SAT problem
Nº Q2030088 ★★
Not listed
-
Extended Euclidean algorithm
Algorithm for computing the coefficients of Bézout's Identity
Nº Q1362750 ★★
Not listed
-
S
SKI combinator calculus
Technique used in functional programming
Nº Q857813 ★
Not listed