In this paper, a genetic algorithm, one of the evolutionary algorithms optimization methods,
is used for the first time for the problem of finding extremal binary self-dual codes. We …

In this work, we apply the idea of composite matrices arising from group rings to derive a
number of different techniques for constructing self-dual codes over finite commutative …

We give a new technique for constructing self-dual codes based on a block matrix whose
blocks arise from group rings and orthogonal matrices. The technique can be used to …

In this work, we define a modification of a bordered construction for self-dual codes which
utilises $\lambda $-circulant matrices. We provide the necessary conditions for the …

One of the interesting recent studies on graph theory is representing a group in a graph. One
of the resulting graphs is a coprime graph. The coprime graph's vertices set consists of every …

In this work, we give three new techniques for constructing Hermitian self-dual codes over
commutative Frobenius rings with a non-trivial involutory automorphism using λ-circulant …

In this paper, a genetic algorithm, one of the evolutionary algorithm optimization methods, is
used for the first time for the problem of computing extremal binary self-dual codes. We …

The main research presented in this thesis is around constructing binary self-dual codes
using group rings together with some well-known code construction methods and the study …