Code loops and even codes over \({\mathbb{F}}_ 4\) (Q1112788)

From MaRDI portal
Revision as of 10:15, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Code loops and even codes over \({\mathbb{F}}_ 4\)
scientific article

    Statements

    Code loops and even codes over \({\mathbb{F}}_ 4\) (English)
    0 references
    0 references
    1988
    0 references
    The notion of code loops and factor sets is introduced by \textit{R. L. Griess} [J. Algebra 100, 224-234 (1986; Zbl 0589.20051)]. For a given doubly even code, a factor set (resp. a code loop, which is defined by such a code and a factor set) is uniquely determined up to some equivalence (resp. up to isomorphism). A code loop, called the Parker loop, related to the binary Golay code is used for the constructions of nonassociative commutative algebras for the Fischer-Griess Monster \(F_ 1\) and the Fischer group \(F_{24}.\) In this paper, an explicit definition of the factor set on the Golay code is given. In this definition, it is important that some subcode of the Golay code can be regarded as the Hexacode over \(F_ 4\). In general, a factor set on a doubly even code which can be regarded as an even code over \(F_ 4\) is defined explicitly.
    0 references
    code loops
    0 references
    factor sets
    0 references
    doubly even code
    0 references
    Parker loop
    0 references
    binary Golay code
    0 references
    Fischer-Griess Monster
    0 references
    Fischer group
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references