Information and communication theory, circuits Object
Golay code
Description
The extended binary Golay code is a linear code of length over the field , of dimension and minimum distance . So it has codewords, and any two differ in at least of the positions; as an error-correcting code it corrects errors. Deleting one coordinate gives the perfect binary Golay code , of length , dimension and minimum distance . Check that is perfect: a Hamming ball of radius in contains words. The balls around the codewords are disjoint, since , and together they contain words, which is all of .
Remarks
The weights of the codewords of are , with codewords of each weight. The codewords of weight , seen as -element subsets of the positions, are the blocks of the Steiner system . The automorphism group of is the Mathieu group , one of the sporadic simple groups. Besides the binary codes there is also a ternary Golay code.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | SM1TJSAR75 |
|---|---|
| URI | m2://SM1TJSAR75 |
| Kind | object |
| Writing | W0 stub |
| MSC | 94B25, 05B05 |
| Instance of | Error-correcting code |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.