default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerap Sahinkaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Adrian Korban, Serap Sahinkaya, Deniz Ustun
:
New type I binary $[72, 36, 12]$ self-dual codes from $M_6(\mathbb{F}_2)G$ - Group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm. Adv. Math. Commun. 18(4): 878-891 (2024)- [j17]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes. Adv. Math. Commun. 18(4): 892-908 (2024) - [j16]Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Binary self-dual and LCD codes from generator matrices constructed from two group ring elements by a heuristic search scheme. Adv. Math. Commun. 18(4): 922-934 (2024) - [j15]Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
DNA codes from skew dihedral group ring. Adv. Math. Commun. 18(4): 1138-1154 (2024) - [j14]Deniz Ustun, Serap Sahinkaya, Nurdan Atli:
Developing a secure image encryption technique using a novel S-box constructed through real-coded genetic algorithm's crossover and mutation operators. Expert Syst. Appl. 256: 124904 (2024) - [j13]Steven T. Dougherty, Serap Sahinkaya, Deniz Ustun:
A novel method for image encryption using time signature-dependent s-boxes based on latin squares and the playfair system of cryptography. Multim. Tools Appl. 83(2): 4167-4194 (2024) - [j12]Steven T. Dougherty, Joseph Klobusicky, Serap Sahinkaya, Deniz Ustun:
An S-Box construction from exponentiation in finite fields and its application in RGB color image encryption. Multim. Tools Appl. 83(14): 41213-41241 (2024) - 2023
- [j11]Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Group matrix ring codes and constructions of self-dual codes. Appl. Algebra Eng. Commun. Comput. 34(2): 279-299 (2023) - [j10]Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Additive skew G-codes over finite fields. Appl. Algebra Eng. Commun. Comput. 34(3): 423-442 (2023) - [j9]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
New type i binary [72, 36, 12] self-dual codes from composite matrices and R1 lifts. Adv. Math. Commun. 17(4): 994-1011 (2023) - [j8]Yasemin Cengellenmis, Abdullah Dertli, Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Reversible $ G $-codes over the ring $ {\mathcal{F}}_{j,k} $ with applications to DNA codes. Adv. Math. Commun. 17(6): 1406-1421 (2023) - [j7]Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm. IEEE Trans. Inf. Theory 69(3): 1588-1603 (2023) - 2022
- [j6]Steven T. Dougherty, Adrian Korban, Serap Sahinkaya:
Self-dual additive codes. Appl. Algebra Eng. Commun. Comput. 33(5): 569-586 (2022) - [j5]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Reversible Gk-codes with applications to DNA codes. Des. Codes Cryptogr. 90(7): 1679-1694 (2022) - [j4]Serap Sahinkaya, Adrian Korban, Deniz Ustun:
Maximal entanglement-assisted quantum error correction codes from the skew group ring ${\mathbb {F}}_4 \rtimes _{\varphi } G$ by a heuristic search scheme. Quantum Inf. Process. 21(4): 156 (2022) - [j3]Steven T. Dougherty, Serap Sahinkaya, Deniz Ustun:
Additive Complementary Dual Codes From Group Characters. IEEE Trans. Inf. Theory 68(7): 4444-4452 (2022) - 2021
- [j2]Steven T. Dougherty, Joe Gildea, Adrian Korban, Serap Sahinkaya:
G-codes, self-dual G-codes and reversible G-codes over the ring ${\mathscr{B}}_{j, k}$. Cryptogr. Commun. 13(5): 601-616 (2021) - [j1]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
New singly and doubly even binary [72, 36, 12] self-dual codes from M2(R)G - group matrix rings. Finite Fields Their Appl. 76: 101924 (2021) - [i7]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
New Type I Binary [72, 36, 12] Self-Dual Codes from Composite Matrices and R1 Lifts. CoRR abs/2102.00474 (2021) - [i6]Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Group Matrix Ring Codes and Constructions of Self-Dual Codes. CoRR abs/2102.00475 (2021) - [i5]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
New Singly and Doubly Even Binary [72, 36, 12] Self-Dual Codes from M2(R)G - Group Matrix Rings. CoRR abs/2102.12863 (2021) - [i4]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
An Application of the Virus Optimization Algorithm to the Problem of Finding Extremal Binary Self-Dual Codes. CoRR abs/2103.07739 (2021) - [i3]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Reversible Gk-Codes with Applications to DNA Codes. CoRR abs/2108.02033 (2021) - [i2]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
New Extremal Binary Self-Dual Codes of Length 72 from M6(F2)G - Group Matrix Rings by a Hybrid Search Technique Based on a Neighbourhood-Virus Optimisation Algorithm. CoRR abs/2109.06522 (2021) - 2020
- [i1]Adrian Korban, Serap Sahinkaya, Deniz Ustun:
A Novel Genetic Search Scheme Based on Nature - Inspired Evolutionary Algorithms for Self-Dual Codes. CoRR abs/2012.12248 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
