Related papers: Isometry Groups of Combinatorial Codes
A perfect isometry is an important relation between blocks of finite groups as many information about blocks are preserved by it. If we consider the group of all perfect isometries between a block to itself then this gives another…
We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
Binary codes are constructed from incidence matrices of hypergraphs. A combinatroial description is given for the minimum distances of such codes via a combinatorial tool called ``eonv". This combinatorial approach provides a faster…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
The set of subspaces with a given dimension in an attenuated space has a structure of a symmetric association scheme, which is a generalization of both Grassmann schemes and bilinear forms schemes. In [K. Wang, J. Guo, F. Li, Association…
We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Given a 2-manifold, a fundamental question to ask is which groups can be realized as the isometry group of a Riemannan metric of constant curvature on the manifold. In this paper, we give a nearly complete classification of such groups for…
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…
For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…
For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…
The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…
The trialitarian automorphisms considered in this paper are the outer automorphisms of order 3 of adjoint classical groups of type D_4 over arbitrary fields. A one-to-one correspondence is established between their conjugacy classes and…
New families of unit memory as well as multi-memory convolutional codes are constructed algebraically in this paper. These convolutional codes are derived from the class of group character codes. The proposed codes have basic generator…
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…
We study automorphism groups of formal matrix algebras. We also consider automorphisms of ordinary matrix algebras (in particular, triangular matrix algebras).
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…
We use the combinatorial harmonic map theory to study the isometric actions of discrete groups on Hadamard spaces. Given a finitely generated group acting by automorphisms, properly discontinuously and cofinitely on a simplicial complex and…
The group of automorphisms of the geometry of an integrable system is considered. The geometrical structure used to obtain it is provided by a normal form representation of integrable systems that do not depend on any additional geometrical…