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
-
FROG
Block cipher
Nº Q3063412 ★
Not listed
-
B
Binet’s theorem
Nº Q3983995 ★
Not listed
-
Donald Knuth
American computer scientist and mathematician (born 1938)
Nº Q17457 ★★★
Not listed
-
Ferdinand Georg Frobenius
German mathematician (1849–1917)
Nº Q57228 ★
Not listed
-
Q
Quran code
Alleged hidden pattern in the Quranic text based on the number 19
Nº Q107043701 ★★
Not listed
-
Lie theory
Study of Lie groups, Lie algebras and differential equations
Nº Q357300 ★
Not listed
-
Navajo Code Talker
Nº Q4956462 ★★
Not listed
-
U
UTF-8
Variable-width encoding (into one to four bytes) and transformation format of code points for the universal character set defined by ISO/IEC 10646 and The Unicode® Standard, compatible with ASCII
Nº Q193537 ★★★★
Not listed
-
R
Relational model
Database model
Nº Q755662 ★★★
Not listed
-
Urs Hölzle
Swiss computer scientist
Nº Q7901133 ★★
Not listed
-
G
Geocode
Code that represents a geographic entity (location or object)
Nº Q36214810 ★
Not listed
-
ASCII
American character encoding standard
Nº Q8815 ★★★★★
Not listed
-
Morse code
Communication code with signals representing letters, punctuation marks and numbers
Nº Q79897 ★★★★★
Not listed
-
History of logarithms
Aspect of history
Nº Q22615167 ★★
Not listed
-
M
Miller–Rabin primality test
Probabilistic primality test
Nº Q980224 ★★★
Not listed
-
B
Byte-pair encoding
Algorithm for data compression and tokenization that iteratively replaces the most frequent pairs of consecutive bytes or symbols with a new representation
Nº Q860962 ★★
Not listed
-
M
Modularity theorem
Theorem in mathematics
Nº Q649469 ★★★
Not listed
-
EBCDIC
Computer character encoding
Nº Q627945 ★★
Not listed