Nonassociative Code Loops

• Nonassociative code loops are Moufang loops constructed as central extensions of doubly-even binary codes by a cyclic group of order two, exemplified by Parker’s loop.
• They are characterized by explicit combinatorial cocycle identities and minimal representations that enable efficient computational implementations.
• Classification results reveal exactly five rank-3 and sixteen rank-4 nonassociative code loops, highlighting their deep connections with coding theory, finite groups, and groups with triality.

Nonassociative code loops constitute a prominent class of Moufang loops arising as central extensions of doubly-even binary codes by the cyclic group of order two. These loops furnish explicit, tractable examples of nonassociative algebraic systems satisfying the Moufang identities, with deep connections to coding theory, finite group theory, and the theory of groups with triality. The prototypical example, Parker’s loop, arises from the extended binary Golay code and plays a central role in the construction of the Monster simple group. Recent advances provide explicit classification and constructive algorithms for minimal representatives of all nonassociative code loops of ranks three and four, supporting fast computational implementations and elucidating their inner structure (Nagy et al., 2019, Pires et al., 2019, Pires et al., 5 Jan 2026, Pires et al., 5 Jan 2026).

1. Definitions and Structural Properties

Let $K = \mathbb{F}_2$ and $K^n$ denote the $n$-dimensional binary vector space. A doubly even binary code is a $K$-subspace $V \subseteq K^n$ where every nonzero $v \in V$ satisfies $|v| \equiv 0 \pmod{4}$, with $|v|$ the Hamming weight.

Given such a $V$, the associated code loop $L(V)$ is the set $\{\pm1\} \times V$ with product

$$(\varepsilon,u)\cdot(\delta,v) = (\varepsilon\delta\,\phi(u,v),\ u+v)$$

where $\phi : V \times V \to \{\pm1\}$ (the factor set) is defined by:

• $\phi(v,v) = (-1)^{|v|/4}$
• $\phi(v,w)\phi(w,v) = (-1)^{|v \cap w|/2}$
• $\phi(0,v) = 1$
• $$\phi(v+w,u) = \phi(v,w+u)\,\phi(v,w)^{-1}\,\phi(w,u)^{-1}\,(-1)^{|v \cap w \cap u|}$$

This construction makes $L(V)$ a Moufang loop: a loop (a quasigroup with identity and two-sided inverses) satisfying the Moufang identities

$(xy)(zx) = x((yz)x)$

and analogues. Moufang loops generalize groups; associativity is not required, and indeed $L(V)$ is associative only if all triple intersections $|u \cap v \cap w|$ are even for $u,v,w \in V$ (Pires et al., 2019, Pires et al., 5 Jan 2026).

Nonassociativity in code loops is characterized by the existence of a unique nonidentity associator:

$$(u,v,w) = ((uv)w)\left(u(vw)\right)^{-1} = (-1)^{|u \cap v \cap w|}.$$

2. Central Extensions and Twisted Cocycle Approach

Code loops are realized as central extensions

$$0 \longrightarrow \mathbb{F}_2 \longrightarrow L \longrightarrow C \longrightarrow 0$$

where $C$ is a doubly-even binary code, via an explicit “twisted” product encoded by a 2-cocycle $\theta : C \times C \to \mathbb{F}_2$. This cocycle must satisfy the following identities for all $u,v,w \in C$ (arithmetic in $\mathbb{F}_2$):

• Cocycle law: $$\theta(v,w) - \theta(u+v,w) + \theta(u,v+w) - \theta(u,v) = |u \cdot v \cdot w| \bmod 2$$
• Symmetry: $$\theta(v,w) + \theta(w,v) = \frac{1}{2}|v \cdot w| \bmod 2$$
• Self-value: $\theta(v,v) = \frac{1}{4}|v| \bmod 2$

The product in the loop is

$$(\varepsilon,v) \star (\delta,w) = (\varepsilon + \delta + \theta(v,w), v + w),$$

where all operations are mod $2$ (Nagy et al., 2019).

Associators and commutators are entirely combinatorial:

• Associator: $f(u,v,w) = |u \cdot v \cdot w| \bmod 2$, directly measuring associativity failure.
• Commutator: $$[(v,\varepsilon), (w,\delta)] = (|v \cdot w| \bmod 2, 0)$$.

In Parker’s loop, $\theta$ can be reconstructed from a small fragment (e.g., a $128 \times 128$ block) rather than the entire $2^{12} \times 2^{12}$ table, due to the identities among its cocycle values (Nagy et al., 2019).

3. Classification and Representations of Nonassociative Code Loops

Classification results establish that up to isomorphism, there are exactly five nonassociative code loops of rank $3$ and sixteen of rank $4$. Each is specified by its “characteristic vector” $\lambda$ recording loop-invariants: squares $x_i^2$, commutators $[x_i, x_j]$, and associator $(x_1, x_2, x_3) = -1$.

A representation of a code loop $L$ is a doubly even code $V \subseteq \mathbb{F}_2^m$ such that $L \cong L(V)$. A representation is minimal if $m$ is minimal; reduced if the induced partition of coordinates into equivalence classes (by generator support) yields no class of size greater than $7$. The minimal representations for all isomorphism classes are listed explicitly for ranks $3$ and $4$ (Pires et al., 2019, Pires et al., 5 Jan 2026).

Table: Minimal Representations of Nonassociative Code Loops (Rank 3 and 4)

Rank	Number of Nonassoc. Loops	Representative Minimal Generating Sets (Support)
3	5	e.g., $\langle (1,2,3,4),\ (1,2,5,6),\ (1,3,5,7)\rangle$ for $C^3_1$
4	16	e.g., $$\langle (1,2,3,4), (1,2,5,6), (1,3,5,7), (1\text{--}8)\rangle$$ for $C^4_1$

Each minimal representation encodes the unique nontrivial associator and corresponding invariants explicitly, determining the full loop structure (Pires et al., 2019, Pires et al., 5 Jan 2026).

4. Construction via Groups with Triality

Code loops also arise as Moufang loops associated to groups with triality, as formalized by Doro. A group with triality is a pair $(G,S)$ where $S \leq \text{Aut}(G)$ is generated by involutory and order-three automorphisms $\sigma, \rho$ satisfying

$\sigma^2 = \rho^3 = (\sigma\rho)^2 = 1$

and the triality identity

$$[g,\sigma] [g,\sigma]^{\rho} [g,\sigma]^{\rho^2} = 1,$$

for all $g \in G$, where $[g,\sigma] = g^{-1} g^{\sigma}$. The Moufang loop is constructed using $M = \{ x^{-1}x^{\sigma} : x \in G \}$ with a nonassociative multiplication, yielding a loop in the variety generated by code loops.

For each $n$, Pires–Grishkov–Rodrigues–Rasskazova construct a nilpotent group $G_n$ of class $3$ with $2n$ generators and show that the corresponding Moufang loop $F_n = L(G_n)$ is the free code loop of rank $n$. All finite code loops of rank $n$ arise as quotients of $F_n$, clarifying the structure and universality of code loops within Moufang theory (Pires et al., 5 Jan 2026).

5. Algorithms, Splittings, and Computational Aspects

The combinatorial structure of code loops admits efficient constructive algorithms for cocycle reconstruction and fast loop multiplication. The “basis extension” algorithm builds $\theta$ incrementally, using only local cocycle and symmetry identities at each step. Storage is optimized by working on appropriately chosen decompositions $C = V \oplus W$, storing only $\theta$ values on a small domain and reconstructing the full cocycle via a master formula (Nagy et al., 2019).

For Parker's loop over the Golay code, this approach allows for the recovery of all cocycle values and thus the entire multiplication from a $128 \times 128$ subset, enabling rapid multiplications on large code loops using only bitwise operations and memory lookups (Nagy et al., 2019).

A direct product decomposition applies when $C = V \oplus W$:

• $P|_V = \mathbb{F}_2 \times V$ is a group,
• $P|_W = \mathbb{F}_2 \times W$ is a direct product of $(\mathbb{F}_2)^3$ and the 16-element Moufang loop $M_{16}$,
• $P \cong (\mathbb{F}_2)^{10} \times M_{16}$ as an internal direct product (Nagy et al., 2019).

6. Criteria for Nonassociativity and Explicit Examples

Nonassociativity in $L(V)$ is encoded combinatorially: $L(V)$ is nonassociative if and only if there exist three basis vectors of $V$ whose triple intersection has odd cardinality—i.e., the associator $(v_1,v_2,v_3) = -1$. This exclusive occurrence of a unique nontrivial associator is a hallmark of code loops and distinguishes them among Moufang loops.

Explicit listing of minimal representations allows for a complete classification of all nonassociative code loops of small rank. For example, $C^3_1$ is realized by $$V^3_1 = \langle \{1,2,3,4\},\,\{1,2,5,6\},\,\{1,3,5,7\} \rangle \subset \mathbb{F}_2^7$$, with Hamming weights and intersections satisfying the required invariants. All classification theorems and representative generating sets for code loops of ranks $3$ and $4$ are provided in explicit combinatorial terms (Pires et al., 2019, Pires et al., 5 Jan 2026).

7. Generalizations, Universality, and Research Outlook

The group-with-triality approach situates code loops within a broader context: every Moufang loop arises from such a group, but those in the variety generated by code loops (“code loop variety”) correspond to nilpotent groups $G_n$ with triality as constructed in (Pires et al., 5 Jan 2026). The universality and freeness properties make code loops cornerstones for the structure theory of finite Moufang loops, and all nonassociative code loops of given rank are quotients of a canonical free code loop associated to $G_n$.

Recent computational advances and combinatorial algorithms for code loops facilitate their study in large dimensions and inform explicit computations in group theory and algebraic combinatorics. The interplay of central extensions, cocycle identities, and triality symmetries continues to motivate further research, notably in connections with sporadic simple groups and the algebraic theory of error-correcting codes (Nagy et al., 2019, Pires et al., 2019, Pires et al., 5 Jan 2026, Pires et al., 5 Jan 2026).