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 …
is used for the first time for the problem of finding extremal binary self-dual codes. We …
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 …
number of different techniques for constructing self-dual codes over finite commutative …
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 $\lambda $-circulant matrices. We provide the necessary conditions for the …
utilises $\lambda $-circulant matrices. We provide the necessary conditions for the …
Quaternary Hermitian self-dual codes of lengths 26, 32, 36, 38 and 40 from modifications of well-known circulant constructions
AM Roberts - Applicable Algebra in Engineering, Communication …, 2022 - Springer
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 …
commutative Frobenius rings with a non-trivial involutory automorphism using λ-circulant …
A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes
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 …
used for the first time for the problem of computing extremal binary self-dual codes. We …