arXiv subjects

Adrian Korban

Publications and source records attributed to Adrian Korban.

15 recordsLinked to original sources

arXiv2022

New binary self-dual codes of lengths 56, 62, 78, 92 and 94 from a bordered construction

In this paper, we present a new bordered construction for self-dual codes which employs $λ$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring of characteristic 2. Moreover, using our bordered construction together with the well-known building-up and neighbour methods, we construct many binary self-dual codes of lengths 56, 62, 78, 92 and 94 with parameters in their weight enumerators that were not known in the literature before.

cs.IT↗

arXiv2021

New Extremal Binary Self-Dual Codes of Length 72 from $M_6(\mathbb{F}_2)G$ - Group Matrix Rings by a Hybrid Search Technique Based on a Neighbourhood-Virus Optimisation Algorithm

In this paper, a new search technique based on the virus optimisation algorithm is proposed for calculating the neighbours of binary self-dual codes. The aim of this new technique is to calculate neighbours of self-dual codes without reducing the search field in the search process (this is a known in the literature approach due to the computational time constraint) but still obtaining results in a reasonable time (significantly faster when compared to the standard linear computational search). We employ this new search algorithm to the well-known neighbour method and its extension, the $k^{th}$-range neighbours and search for binary $[72,36,12]$ self-dual codes. In particular, we present six generator matrices of the form $[I_{36} \ | \ τ_6(v)],$ where $I_{36}$ is the $36 \times 36$ identity matrix, $v$ is an element in the group matrix ring $M_6(\mathbb{F}_2)G$ and $G$ is a finite group of order 6, which we then employ to the proposed algorithm and search for binary $[72,36,12]$ self-dual codes directly over the finite field $\mathbb{F}_2$. We construct 1471 new Type I binary $[72, 36, 12]$ self-dual codes with the rare parameters $γ=11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 32$ in their weight enumerators.

cs.IT↗

arXiv2021

Binary self-dual codes of various lengths with new weight enumerators from a modified bordered construction and neighbours

In this work, we define a modification of a bordered construction for self-dual codes which utilises $λ$-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative Frobenius rings of characteristic 2. Using the modified construction together with the neighbour construction, we construct many binary self-dual codes of lengths 54, 68, 82 and 94 with weight enumerators that have previously not been known to exist.

cs.IT↗

arXiv2021

Group LCD and Group Reversible LCD Codes

In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the $n \times n$ matrices to obtain LCD codes. Our construction method guarantees that our LCD codes are also group codes, namely, the codes are ideals in a group ring. We show that with a certain condition on the group ring element $v,$ one can construct non-trivial group LCD codes. Moreover, we also show that by adding more constraints on the group ring element $v,$ one can construct group LCD codes that are reversible. We present many examples of binary group LCD codes of which some are optimal and group reversible LCD codes with different parameters.

cs.IT↗

arXiv2021

Reversible $G^k$-Codes with Applications to DNA Codes

In this paper, we give a matrix construction method for designing DNA codes that come from group matrix rings. We show that with our construction one can obtain reversible $G^k$-codes of length $kn,$ where $k, n \in \mathbb{N},$ over the finite commutative Frobenius ring $R.$ We employ our construction method to obtain many DNA codes over $\mathbb{F}_4$ that satisfy the Hamming distance, reverse, reverse-complement and the fixed GC-content constraints. Moreover, we improve many lower bounds on the sizes of some known DNA codes and we also give new lower bounds on the sizes of some DNA codes of lengths $48, 56, 60, 64$ and $72$ for some fixed values of the Hamming distance $d.$

cs.IT↗

arXiv2021

New binary self-dual codes of lengths 80, 84 and 96 from composite matrices

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 Frobenius rings. By applying these techniques over different alphabets, we construct best known singly-even binary self-dual codes of lengths 80, 84 and 96 as well as doubly-even binary self-dual codes of length 96 that were not known in the literature before.

math.CO↗

arXiv2021

New binary self-dual codes of lengths 56, 58, 64, 80 and 92 from a modification of the four circulant construction

In this work, we give a new technique for constructing self-dual codes over commutative Frobenius rings using $λ$-circulant matrices. The new construction was derived as a modification of the well-known four circulant construction of self-dual codes. Applying this technique together with the building-up construction, we construct singly-even binary self-dual codes of lengths 56, 58, 64, 80 and 92 that were not known in the literature before. Singly-even self-dual codes of length 80 with $β\in\{2,4,5,6,8\}$ in their weight enumerators are constructed for the first time in the literature.

math.CO↗

arXiv2021

An Application of the Virus Optimization Algorithm to the Problem of Finding Extremal Binary Self-Dual Codes

In this paper, a virus optimization algorithm, which is one of the metaheuristic optimization technique, is employed for the first time to the problem of finding extremal binary self-dual codes. We present a number of generator matrices of the form $[I_{36} \ | \ τ_3(v)],$ where $I_{36}$ is the $36 \times 36$ identity matrix, $v$ is an element in the group matrix ring $M_3(\mathbb{F}_2)G$ and $G$ is a finite group of order 12, which we then employ together with the the virus optimization algorithm and the genetic algorithm to search for extremal binary self-dual codes of length 72. We obtain that the virus optimization algorithm finds more extremal binary self-dual codes than the genetic algorithm. Moreover, by employing the above mentioned constructions together with the virus optimization algorithm, we are able to obtain 39 Type I and 19 Type II codes of length 72, with parameters in their weight enumerators that were not known in the literature before.

cs.IT↗

arXiv2021

New Singly and Doubly Even Binary [72,36,12] Self-Dual Codes from $M_2(R)G$ -- Group Matrix Rings

In this work, we present a number of generator matrices of the form $[I_{2n} \ | \ τ_k(v)],$ where $I_{kn}$ is the $kn \times kn$ identity matrix, $v$ is an element in the group matrix ring $M_2(R)G$ and where $R$ is a finite commutative Frobenius ring and $G$ is a finite group of order 18. We employ these generator matrices and search for binary $[72,36,12]$ self-dual codes directly over the finite field $\mathbb{F}_2.$ As a result, we find 134 Type I and 1 Type II codes of this length, with parameters in their weight enumerators that were not known in the literature before. We tabulate all of our findings.

cs.IT↗

arXiv2021

New Type I Binary [72, 36, 12] Self-Dual Codes from Composite Matrices and R1 Lifts

In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | Ω(v)], where In is the identity matrix and Ω(v) is a composite matrix and search for binary self-dual codes with parameters [36, 18, 6 or 8]. We next lift these codes over the ring R1 = F2 + uF2 to obtain codes whose binary images are self-dual codes with parameters [72,36,12]. Many of these codes turn out to have weight enumerators with parameters that were not known in the literature before. In particular, we find 30 new Type I binary self-dual codes with parameters [72, 36, 12].

cs.IT↗

arXiv2021

Group Matrix Ring Codes and Constructions of Self-Dual Codes

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 spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is the commutative Frobenius ring. We show that codes over the ring $M_k(R)$ are one sided ideals in the group matrix ring $M_k(R)G$ and the corresponding codes over the ring $R$ are $G^k$-codes of length $kn.$ Additionally, we give a generator matrix for self-dual codes, which consist of the mentioned above matrix construction. We employ this generator matrix to search for binary self-dual codes with parameters $[72,36,12]$ and find new singly-even and doubly-even codes of this type. In particular, we construct $16$ new Type~I and $4$ new Type~II binary $[72,36,12]$ self-dual codes.

cs.IT↗

arXiv2020

A Novel Genetic Search Scheme Based on Nature -- Inspired Evolutionary Algorithms for Self-Dual Codes

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 present a comparison of the computational times between a genetic algorithm and a linear search for different size search spaces and show that the genetic algorithm is capable of finding binary self-dual codes significantly faster than the linear search. Moreover, by employing a known matrix construction together with the genetic algorithm, we are able to obtain new binary self-dual codes of lengths 68 and 72 in a significantly short time. In particular, we obtain 11 new extremal binary self-dual codes of length 68 and 17 new binary self-dual codes of length 72.

cs.NE↗

arXiv2020

New Self-Dual Codes of length 68 from a 2 by 2 block matrix Construction and Group Rings

Many generator matrices for constructing extremal binary self-dual codes of different lengths have the form G=(I|A), where I is the n by n identity matrix and A is the n by n matrix fully determined by the first row. In this work, we define a generator matrix in which A is a block matrix, where the blocks come from group rings and also, A is not fully determined by the elements appearing in the first row. By applying our construction over F_2+uF_2 and by employing the extension method for codes, we were able to construct new extremal binary self-dual codes of length 68. Additionally, by employing a generalised neighbour method to the codes obtained, we were able to construct many new binary self-dual [68,34,12]-codes with the rare parameters gamma=7,8 and 9 in W_{68,2}. In particular, we find 92 new binary self-dual [68,34,12]-codes.

cs.IT↗

arXiv2020

Composite Matrices from Group Rings, Composite G-Codes and Constructions of Self-Dual Codes

In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring and G is an arbitrary finite group. We prove that the dual of a composite G-code is also a composite G-code. We define quasi-composite G-codes and give a construction of these codes. We also study generator matrices, which consist of the identity matrices and the composite matrices. Together with the generator matrices, the well known extension method, the neighbour method and its generalization, we find extremal binary self-dual codes of length 68 with new weight enumerators for the rare parameters gamma=7,8 and 9. In particular, we find 49 new such codes. Moreover, we show that the codes we find are inaccessible from other constructions.

cs.IT↗

arXiv2020

New Extremal binary self-dual codes of length 68 from a novel approach to neighbors

In this work, we introduce the concept of distance between self-dual codes, which generalizes the concept of a neighbor for self-dual codes. Using the k-neighbors, we are able to construct extremal binary self-dual codes of length 68 with new weight enumerators. We construct 143 extremal binary self-dual codes of length 68 with new weight enumerators including 42 codes with gamma=8 in their W_{68,2} and 40 with gamma=9 in their W_{68,2}. These examples are the first in the literature for these gamma values. This completes the theoretical list of possible values for gamma in W_{68,2}.

math.CO↗