default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTekgül Kalayci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Nurdagül Anbar
, Tekgül Kalayci, Wilfried Meidl, Ferruh Özbudak:
(2p + 1)-class association schemes from the generalized Maiorana-McFarland class. Finite Fields Their Appl. 103: 102568 (2025)- [j11]Sezel Alkan, Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Bent Partition, Vectorial Dual-Bent Function, and LP-Packing Constructions. IEEE Trans. Inf. Theory 71(1): 752-767 (2025) - 2024
- [j10]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Amorphic association schemes from bent partitions. Discret. Math. 347(1): 113658 (2024) - [j9]Sezel Alkan, Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Bent Partitions and LP-Packings. IEEE Trans. Inf. Theory 70(7): 5365-5375 (2024) - [i4]Nurdagül Anbar, Tekgül Kalayci, Alev Topuzoglu:
On functions of low differential uniformity in characteristic 2: A close look (I). CoRR abs/2406.07468 (2024) - 2023
- [j8]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
On generalized spread bent partitions. Cryptogr. Commun. 15(6): 1217-1234 (2023) - [j7]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Generalized semifield spreads. Des. Codes Cryptogr. 91(2): 545-562 (2023) - [i3]Zohreh Aliabadi, Tekgül Kalayci:
A note on the hull and linear complementary pair of cyclic codes. CoRR abs/2304.12229 (2023) - [i2]Zohreh Aliabadi, Cem Güneri, Tekgül Kalayci:
On the hull and complementarity of one generator quasi-cyclic codes and four-circulant codes. CoRR abs/2307.05449 (2023) - 2022
- [j6]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai:
On a Class of Functions With the Maximal Number of Bent Components. IEEE Trans. Inf. Theory 68(9): 6174-6186 (2022) - [j5]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Bent Partitions and Partial Difference Sets. IEEE Trans. Inf. Theory 68(10): 6894-6903 (2022) - 2021
- [j4]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Analysis of (n, n)-Functions Obtained From the Maiorana-McFarland Class. IEEE Trans. Inf. Theory 67(7): 4891-4901 (2021) - 2020
- [j3]Tekgül Kalayci, Henning Stichtenoth, Alev Topuzoglu:
Permutation polynomials and factorization. Cryptogr. Commun. 12(5): 913-934 (2020) - [j2]Tekgül Kalayci, Henning Stichtenoth, Alev Topuzoglu:
Irreducible factors of a class of permutation polynomials. Finite Fields Their Appl. 63: 101647 (2020) - [i1]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai:
On functions with the maximal number of bent components. CoRR abs/2010.03801 (2020)
2010 – 2019
- 2019
- [j1]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Determining the Walsh spectra of Taniguchi's and related APN-functions. Finite Fields Their Appl. 60 (2019)
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 2025-03-05 21:55 CET 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:
