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

Basit Öğe Kaydı
dc.authoridhttps://orcid.org/0000-0001-5206-6480en_US
dc.authoridhttps://orcid.org/0000-0002-5229-4018en_US
dc.authoridhttps://orcid.org/0000-0002-2084-6260en_US
dc.authorscopusid57206665622en_US
dc.authorscopusid55420759300en_US
dc.authorscopusid36728602600en_US
dc.authorwosidDWJ-0396-2022en_US
dc.authorwosidABB-4228-2020en_US
dc.authorwosidGQB-3301-2022en_US
dc.contributor.authorKorban, Adrian
dc.contributor.authorŞahinkaya, Serap
dc.contributor.authorÜstün, Deniz
dc.date.accessioned2024-08-01T10:55:56Z
dc.date.available2024-08-01T10:55:56Z
dc.date.issued2022en_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.description.abstractIn 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.citationDougherty, 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.doi10.3934/amc.2022032en_US
dc.identifier.endpage891en_US
dc.identifier.issn1930-5346
dc.identifier.issn1930-5338
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-85196812113en_US
dc.identifier.startpage878en_US
dc.identifier.urihttps://www.aimsciences.org/article/doi/10.3934/amc.2022032?viewType=html
dc.identifier.urihttps://hdl.handle.net/20.500.13099/310
dc.identifier.volume18en_US
dc.identifier.wos000793078300001en_US
dc.identifier.wosqualityQ3en_US
dc.institutionauthorŞahinkaya, Serap
dc.institutionauthorÜstün, Deniz
dc.language.isoengen_US
dc.publisherAmerican Institute of Mathematical Sciences (AIMS)en_US
dc.relation.ispartofAdvances in Mathematics of Communicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_US
dc.subjectLinear codesen_US
dc.subjectbinary self-dual codesen_US
dc.subjectgroup matrix ringsen_US
dc.subjectneighbours of self-dual codesen_US
dc.subjectevolutionary algorithmsen_US
dc.titleNew 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 algorithmen_US
dc.typearticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
2024-08-01 135415.png
Boyut:
231.37 KB
Biçim:
Portable Network Graphics
Açıklama:
Makale Dosyası
İndir
Lisans paketi
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu