Direct construction of code loops.
From MaRDI portal
Abstract: Code loops were introduced by R. L. Griess. R.L. Griess and T. Hsu gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods used some kind of induction. In this paper, we present a global construction of the loop, where we apply the correspondance between the concepts of Moufang loops and groups with triality.
Recommendations
Cites work
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 2061611 (Why is no real title available?)
- scientific article; zbMATH DE number 1759155 (Why is no real title available?)
- scientific article; zbMATH DE number 3227065 (Why is no real title available?)
- A simple construction for the Fischer-Griess monster group
- Code loops
- Code loops and even codes over \({\mathbb{F}}_ 4\)
- Explicit constructions of code loops as centrally twisted products
- Loops as Invariant Sections in Groups, and their Geometry
- Moufang loops with a unique nonidentity commutator (associator, square)
- Simple Moufang loops
- The classification of finite simple Moufang loops
Cited in
(11)- (Re)constructing code loops
- Sporadic groups, code loops and nonvanishing cohomology
- Variety of loops generated by code loops
- Explicit constructions of code loops as centrally twisted products
- Code loops in both parities
- scientific article; zbMATH DE number 5994924 (Why is no real title available?)
- Combinatorial polarization, code loops, and codes of high level
- Code loops
- An extension formula for right Bol loops arising from Bol reflections
- Code loops in dimension at most \(8\)
- The Moufang loops of order 64 and 81.
This page was built for publication: Direct construction of code loops.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998416)