In this paper we outline a method for constructing strongly regular graphs from orbit matrices
admitting an automorphism group of composite order. In 2011, C. Lam and M. Behbahani …

In this paper, we present a method for constructing extremal Z4-codes based on random
neighborhood search. This method is used to find new extremal Type I and Type II Z4-codes …

A new notion of bent sequence related to Hadamard matrices was introduced recently,
motivated by a security application (Solé, et al., 2021). The authors study the self-dual class …

We propose a method of constructing block designs which combine genetic algorithm and a
method for constructing designs with a prescribed automorphism group using tactical …

In this paper, we introduce orbit matrices of directed strongly regular graphs (DSRGs).
Further, we propose a method of constructing directed strongly regular graphs with …

In this paper, we classified Hadamard $2$-$(51, 25, 12) $ designs having a non-abelian
automorphism group of order 10, ie, ${\rm {Frob}} _ {10}\cong Z_5: Z_2 $, where a subgroup …

Let F be a finite field of q elements and G be a primitive group on a finite set Ω. Then there is
a G-action on Ω, namely a map G× Ω−→ Ω,(g, ω)↦→ ωg= gω, satisfying ωgg′=(gg′) ω= g …

In this paper, we give a construction of doubly even self-orthogonal codes from quasi-
symmetric designs. Especially, we study orbit matrices of quasi-symmetric designs and give …

In this paper, we introduce a switching for 2-designs, which defines a type of trade. We
illustrate this method by applying it to some symmetric (64, 28, 12) designs, showing that the …

Sažetak Through a modular representation theoretical approach we enumerate all non-
trivial codes from the 2-modular representations of A8, using a chain of maximal …