Direct construction of code loops.
From MaRDI portal
Publication:998416
DOI10.1016/J.DISC.2007.09.056zbMATH Open1171.20042arXivmath/0411315OpenAlexW1989105265MaRDI QIDQ998416FDOQ998416
Authors: G. P. Nagy 
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0411315
Recommendations
Cites Work
- A simple construction for the Fischer-Griess monster group
- Title not available (Why is that?)
- The classification of finite simple Moufang loops
- Simple Moufang loops
- Title not available (Why is that?)
- Code loops
- Title not available (Why is that?)
- Explicit constructions of code loops as centrally twisted products
- Moufang loops with a unique nonidentity commutator (associator, square)
- Loops as Invariant Sections in Groups, and their Geometry
- Title not available (Why is that?)
- Code loops and even codes over \({\mathbb{F}}_ 4\)
Cited In (11)
- Sporadic groups, code loops and nonvanishing cohomology
- Combinatorial polarization, code loops, and codes of high level
- (Re)constructing code loops
- Variety of loops generated by code loops
- An extension formula for right Bol loops arising from Bol reflections
- Explicit constructions of code loops as centrally twisted products
- Title not available (Why is that?)
- Code loops in dimension at most \(8\)
- The Moufang loops of order 64 and 81.
- Code loops in both parities
- Code loops
Uses Software
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)
