Related papers: Representations of code loops by binary codes

Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop L, we ask which doubly even binary code V produces L. In this sense, V is called a representation of L. In this article we define and determine…

In this work we construct free Moufang loop in the variety generated by code loops. We apply this construction for study the code loops. Moreover, we define and determine all basic representations of code loops of rank 3 and 4.

Code loops are certain Moufang $2$-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…

The Moufang loop named for Richard Parker is a central extension of the extended binary Golay code. It the prototypical example of a general class of nonassociative structures known today as code loops, which have been studied from a number…

We first find the combinatorial degree of any map $f:V\to F$ where $F$ is a finite field and $V$ is a finite-dimensional vector space over $F$. We then simplify and generalize a certain construction due to Chein and Goodaire that was used…

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…

A Code loop on a binary linear code that is doubly even with a factor set is shown to be a central loop, conjugacy closed loop, Burn loop and extra loop. General forms of the identities that define the factor set of a code are deduced.

Let $L$ be a Moufang loop which is centrally nilpotent of class 2. We first show that the nuclearly-derived subloop (normal associator subloop) $L^*$ of $L$ has exponent dividing 6. It follows that $L_p$ (the subloop of $L$ of elements of…

We derive presentations for Moufang loops of type $M(G,2)$, defined by Chein, with $G$ finite, two-generated. We then use $G=S_3$ to visualize the smallest non-associative Moufang loop.

A representation of an object in a category is an abelian group in the corresponding comma category. In this paper we derive the formulas describing linear representations of objects in the category of formal loops and apply them to obtain…

We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no other nonassociative Moufang loops of order 64. The main idea…

Two constructions due to Dr\'apal produce a group by modifying exactly one quarter of the Cayley table of another group. We present these constructions in a compact way, and generalize them to Moufang loops, using loop extensions. Both…

Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…

Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length…

We consider a construction of the fundamental spin representations of the simple Lie algebras $\mathfrak{so}(n)$ in terms of binary arithmetic of fixed width integers. This gives the spin matrices as a Lie subalgebra of a…

In this paper the linear representations of analytic Moufang loops are investigated. We prove that every representation of semisimple analytic Moufang loop is completely reducible and find all nonassociative irreducible representations. We…

In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many…

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…

A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by $2.$ The purpose of this paper is to investigate interesting properties of Type I codes of different…