default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKamil Otal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Baran Düzgün, Talha Arikan, Kamil Otal
, Ferruh Özbudak:
Asymptotically optimal [2k+1,k,k] -almost affinely disjoint subspaces. Discret. Math. 347(10): 114140 (2024)- [j10]Mehmet Emin Gönen, Muhammed Said Gündogan, Kamil Otal:
Boomerang Attacks on Reduced-Round Midori64. ISC Int. J. Inf. Secur. 16(2): 191-203 (2024) - 2023
- [c1]Talha Arikan, Baran Düzgün, Kamil Otal, Ferruh Özbudak:
A New Construction of Asymptotically Optimal Almost Affinely Disjoint Spaces. ISIT 2023: 282-285 - [i5]Kamil Otal:
A Solution to a Conjecture on the Maps χn(k). IACR Cryptol. ePrint Arch. 2023: 1782 (2023) - 2022
- [j9]Kamil Otal, Talha Arikan:
An asymptotically optimal construction of almost affinely disjoint subspaces. Finite Fields Their Appl. 84: 102099 (2022) - 2021
- [j8]Kamil Otal, Eda Tekin:
Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials. Cryptogr. Commun. 13(5): 837-845 (2021) - [i4]Kamil Otal:
A Generalization of the Subfield Construction. IACR Cryptol. ePrint Arch. 2021: 75 (2021) - 2020
- [j7]Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak:
Subspace packings: constructions and bounds. Des. Codes Cryptogr. 88(9): 1781-1810 (2020)
2010 – 2019
- 2019
- [i3]Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak:
Subspace Packings - Constructions and Bounds. CoRR abs/1909.06081 (2019) - 2018
- [j6]Kamil Otal, Ferruh Özbudak, Wofgang Willems:
Self-duality of generalized twisted Gabidulin codes. Adv. Math. Commun. 12(4): 707-721 (2018) - [j5]Edgar Martínez-Moro, Kamil Otal, Ferruh Özbudak:
Additive cyclic codes over finite commutative chain rings. Discret. Math. 341(7): 1873-1884 (2018) - [j4]Kamil Otal, Ferruh Özbudak:
Some new non-additive maximum rank distance codes. Finite Fields Their Appl. 50: 293-303 (2018) - [i2]Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak:
Subspace Packings. CoRR abs/1811.04611 (2018) - 2017
- [j3]Kamil Otal, Ferruh Özbudak:
Cyclic subspace codes via subspace polynomials. Des. Codes Cryptogr. 85(2): 191-204 (2017) - [j2]Kamil Otal, Ferruh Özbudak:
Additive Rank Metric Codes. IEEE Trans. Inf. Theory 63(1): 164-168 (2017) - [i1]Edgar Martínez-Moro, Kamil Otal, Ferruh Özbudak:
Additive cyclic codes over finite commutative chain rings. CoRR abs/1701.06672 (2017) - 2016
- [j1]Kamil Otal, Ferruh Özbudak:
Explicit constructions of some non-Gabidulin linear maximum rank distance codes. Adv. Math. Commun. 10(3): 589-600 (2016)
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-01-21 00:23 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:
