Code loops in dimension at most 8
E.A. O'Brien, Petr Vojt\v{e}chovsk\'y

TL;DR
This paper classifies and enumerates code loops of dimension up to 8, revealing the vast number of such loops and their structure, which are important in the context of sporadic groups and algebraic combinatorics.
Contribution
It provides a complete enumeration of code loops of dimension at most 8 using classifications of trilinear alternating forms over GF(2).
Findings
767 code loops of order 128
80826 code loops of order 256
937,791,557 code loops of order 512
Abstract
Code loops are certain Moufang -loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of order by an elementary abelian -group in the variety of loops such that their squaring map, commutator map and associator map are related by combinatorial polarization and the associator map is a trilinear alternating form. Using existing classifications of trilinear alternating forms over the field of elements, we enumerate code loops of dimension (equivalently, of order ) up to isomorphism. There are code loops of order , and of order , and of order .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications · Finite Group Theory Research
