Adrian Korban

Mutation-Based Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear Codes

2022 · Turkish Journal of Mathematics and Computer Science

Finding the minimum distance of linear codes is a non-deterministic polynomial-time-hard problem and different approaches are used in the literature to solve this problem.
 Although, some of the methods focus on finding the true distances …

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

2021 · arXiv (Cornell University)

In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring of …