New type I binary [72,36, 12] self-dual codes from M6(F2) G-Group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm
dc.authorid | https://orcid.org/0000-0001-5206-6480 | en_US |
dc.authorid | https://orcid.org/0000-0002-5229-4018 | en_US |
dc.authorid | https://orcid.org/0000-0002-2084-6260 | en_US |
dc.authorscopusid | 57206665622 | en_US |
dc.authorscopusid | 55420759300 | en_US |
dc.authorscopusid | 36728602600 | en_US |
dc.authorwosid | DWJ-0396-2022 | en_US |
dc.authorwosid | ABB-4228-2020 | en_US |
dc.authorwosid | GQB-3301-2022 | en_US |
dc.contributor.author | Korban, Adrian | |
dc.contributor.author | Şahinkaya, Serap | |
dc.contributor.author | Üstün, Deniz | |
dc.date.accessioned | 2024-08-01T10:55:56Z | |
dc.date.available | 2024-08-01T10:55:56Z | |
dc.date.issued | 2022 | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.description.abstract | In this paper, a new search technique based on a 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 technique is known in the literature 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 kth -range neighbours, and search for binary [72, 36, 12] self-dual codes. In particular, we present six generator matrices of the form [I-36 vertical bar tau(6) (v)], where I-36 is the 36 x 36 identity matrix, v is an element in the group matrix ring M-6(F-2)G and G is a finite group of order 6, to which we employ the proposed algorithm and search for binary [72, 36, 12] self-dual codes directly over the finite field F-2. We construct 1471 new Type I binary [72,36,12] self-dual codes with the rare parameters gamma = 11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 32 in their weight enumerators. | en_US |
dc.identifier.citation | Dougherty, S.T., Korban, A., Sahinkaya, S. ve Ustun, D. (2022). New type I binary [72,36, 12] self-dual codes from M6(F2) G-Group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm. Advances in Mathematics of Communications, 18 (4), 878-891. | en_US |
dc.identifier.doi | 10.3934/amc.2022032 | en_US |
dc.identifier.endpage | 891 | en_US |
dc.identifier.issn | 1930-5346 | |
dc.identifier.issn | 1930-5338 | |
dc.identifier.issue | 4 | en_US |
dc.identifier.scopus | 2-s2.0-85196812113 | en_US |
dc.identifier.startpage | 878 | en_US |
dc.identifier.uri | https://www.aimsciences.org/article/doi/10.3934/amc.2022032?viewType=html | |
dc.identifier.uri | https://hdl.handle.net/20.500.13099/310 | |
dc.identifier.volume | 18 | en_US |
dc.identifier.wos | 000793078300001 | en_US |
dc.identifier.wosquality | Q3 | en_US |
dc.institutionauthor | Şahinkaya, Serap | |
dc.institutionauthor | Üstün, Deniz | |
dc.language.iso | eng | en_US |
dc.publisher | American Institute of Mathematical Sciences (AIMS) | en_US |
dc.relation.ispartof | Advances in Mathematics of Communications | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/restrictedAccess | en_US |
dc.subject | Linear codes | en_US |
dc.subject | binary self-dual codes | en_US |
dc.subject | group matrix rings | en_US |
dc.subject | neighbours of self-dual codes | en_US |
dc.subject | evolutionary algorithms | en_US |
dc.title | New type I binary [72,36, 12] self-dual codes from M6(F2) G-Group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm | en_US |
dc.type | article | en_US |