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 …

This paper studies and classifies optimal binary self-dual codes having an automorphism of
order 7 with 9 cycles. This classification is done by applying a method for constructing binary …

In this work, we study codes generated by elements that come from group matrix rings. We
present a matrix construction which we use to generate codes in two different ambient …

In this work, we focus on constructing binary self-dual [68, 34, 12] and [88, 44, 14] codes with
new parameters in their weight enumerators. For this purpose, we present a new bordered …

We describe a bordered construction for self-dual codes coming from group rings. We apply
the constructions coming from the cyclic and dihedral groups over several alphabets to …

In this paper, we employ group rings and skew group rings to construct binary self-dual
codes of length 72. There is a well known map σ that sends a (skew) group ring element to …

In this work, we present a number of generator matrices of the form [I 2 n| τ 2 (v)], where I 2 n
is the 2 n× 2 n identity matrix, v is an element in the group matrix ring M 2 (R) G and where R …

In this paper we obtain at least 61 new singly even (Type I) binary [72, 36, 12] self-dual
codes as a quasi-cyclic codes with m= 2 (tailbitting convolutional codes) and at least 13 new …

On the Structure of Binary LCD Codes having an Automorphism of Odd Prime Order Page 1
0018-9448 (c) 2021 IEEE. Personal use is permitted, but republication/redistribution requires …

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 …