Constant-dimension codes with the maximum possible minimum distance have been
studied under the name of partial spreads in Finite Geometry for several decades. Not …

A linear code over $\mathbb {F} _q $ with the Hamming metric is called $\Delta $-divisible if
the weights of all codewords are divisible by $\Delta $. They have been introduced by …

The main idea behind noncommutative geometry (see [Connes (1994)] for an extensive
treatment of the subject) lies in the correspondence between spaces and algebras of …

Adinkras are graphical tools created to study representations of supersymmetry algebras.
Besides having inherent interest for physicists, the study of adinkras has already shown non …

The Lengths of Projective Triply-Even Binary Codes Page 1 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. 66, NO. 5, MAY 2020 2713 The Lengths of Projective Triply-Even …

Using a Mathematica TM code, we present a straightforward numerical analysis of the 384-
dimensional solution space of signed permutation 4× 4 matrices, which in sets of four …

Uniting the usually distinct areas of particle physics and quantum field theory, gravity and
general relativity, this expansive and comprehensive textbook of fundamental and …

A bstract We present a new method of deriving the off-shell spectrum of supergravity and
massless 4D,\(\mathcal {N}\)= 1 higher spin multiplets without the need of an action and …

An Adinkra is a graph from the study of supersymmetry in particle physics, but it can be
adapted to study Clifford algebra representations. The graph in this context is called a …

Adinkras are signed graphs used to study supersymmetry in physics. We provide an
introduction to these objects, and study the properties of their signed adjacency and signed …