Related papers: (Re)constructing Code Loops
Multiparty computation (MPC) consists in several parties engaging in joint computation in such a way that each party's input and output remain private to that party. Whereas MPC protocols for specific computations have existed since the…
In 1974 Orin Chein discovered a new family of Moufang loops which are now called Chein loops. Such a loop can be created from any group $W$ together with $\mathbb{Z}_2$ by a variation on a semi-direct product. We study these loops in the…
We present an elementary proof that the nonassociative simple Moufang loops over finite prime fields are generated by three elements. In the last section, we conclude that integral Cayley numbers of unit norm are generated multiplicatively…
We study non-associative twisted group algebras over $(\Z_2)^n$ with cubic twisting functions. We construct a series of algebras that extend the classical algebra of octonions in the same way as the Clifford algebras extend the algebra of…
We study conjugacy closed loops (CC-loops) and power-associative CC-loops (PACC-loops). If $Q$ is a PACC-loop with nucleus $N$, then $Q/N$ is an abelian group of exponent 12; if in addition $Q$ is finite, then $|Q|$ is divisible by 16 or by…
Coded computing is a distributed paradigm that uses coding theory to introduce \textit{redundancy} and overcome bottlenecks in large-scale systems. In the same vein, randomized numerical linear algebra employs probabilistic methods to…
We study abelian-by-cyclic Moufang loops. We construct all split $3$-divisible abelian-by-cyclic Moufang loops from so-called Moufang permutations on abelian groups $(X,+)$, which are permutations that deviate from an automorphism of…
We define a variety of loops called semiautomorphic, inverse property loops that generalize Moufang and Steiner loops. We first show an equivalence between a previously studied variety of loops. Next we extend several known results for…
Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…
We introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function (PUF) response. We extend classical coding methods to construct multiply constant-weight codes from known $q$-ary…
The paper defines the notion of alternative loop algebra F[Q] for any nonassociative Moufang loop Q as being any non-zero homomorphic image of the loop algebra FQ of a loop Q over a field F. For the class M of all nonassociative alternative…
Quantum LDPC codes have attracted intense interest due to their advantageous properties for realizing efficient fault-tolerant quantum computing. In particular, sheaf codes represent a novel framework that encompasses all well-known good…
Product codes are a class of quantum error correcting codes built from two or more constituent codes. They have recently gained prominence for a breakthrough yielding quantum low-density parity-check (qLDPC) codes with favorable scaling of…
In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…
Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…
It is proved that any free Moufang loop can be embedded in a loop of invertible elements of some alternative algebra.
Tensors are a fundamental operation in distributed computing, \emph{e.g.,} machine learning, that are commonly distributed into multiple parallel tasks for large datasets. Stragglers and other failures can severely impact the overall…
Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and validation of a reversible circuit simulating a given function…