default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBuket Özkaya
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Ferruh Özbudak, Buket Özkaya
:
Quasi-twisted codes as contractions of quasi-cyclic codes. Adv. Math. Commun. 18(2): 394-409 (2024)- [j16]Markus Grassl, Ferruh Özbudak, Buket Özkaya, Burcu Gülmez Temür:
Complete characterization of a class of permutation trinomials in characteristic five. Cryptogr. Commun. 16(4): 825-841 (2024) - [j15]Ferruh Özbudak, Buket Özkaya:
New distance bounds for quasi-cyclic codes. Des. Codes Cryptogr. 92(12): 3981-4009 (2024) - [j14]Gaojun Luo, Martianus Frederic Ezerman, San Ling, Buket Özkaya:
Improved Spectral Bound for Quasi-Cyclic Codes. IEEE Trans. Inf. Theory 70(6): 4002-4015 (2024) - [i11]Martianus Frederic Ezerman, Markus Grassl, San Ling, Ferruh Özbudak, Buket Özkaya:
Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes. CoRR abs/2405.15057 (2024) - 2023
- [i10]Gaojun Luo, Martianus Frederic Ezerman, San Ling, Buket Özkaya:
Improved Spectral Bound for Quasi-Cyclic Codes. CoRR abs/2311.08156 (2023) - 2021
- [j13]San Ling, Buket Özkaya:
New bounds on the minimum distance of cyclic codes. Adv. Math. Commun. 15(1): 1-8 (2021) - [j12]Martianus Frederic Ezerman, John Mark Lampos, San Ling, Buket Özkaya, Jareena Tharnnukhroh:
A Comparison of Distance Bounds for Quasi-Twisted Codes. IEEE Trans. Inf. Theory 67(10): 6476-6490 (2021) - 2020
- [j11]Adel Alahmadi, Cem Güneri, Buket Özkaya, Hatoon Shohaib, Patrick Solé:
On complementary dual multinegacirculant codes. Cryptogr. Commun. 12(1): 101-113 (2020) - [i9]Cem Güneri, San Ling, Buket Özkaya:
Quasi-Cyclic Codes. CoRR abs/2007.16029 (2020) - [i8]Martianus Frederic Ezerman, John Mark Lampos, San Ling, Buket Özkaya, Jareena Tharnnukhroh:
A Comparison of Distance Bounds for Quasi-Twisted Codes. CoRR abs/2012.10081 (2020)
2010 – 2019
- 2019
- [j10]San Ling, Buket Özkaya:
Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes. Des. Codes Cryptogr. 87(12): 2941-2965 (2019) - [c2]Martianus Frederic Ezerman, San Ling, Buket Özkaya, Jareena Tharnnukhroh:
Spectral Bounds for Quasi-Twisted Codes. ISIT 2019: 1922-1926 - [c1]Martianus Frederic Ezerman, San Ling, Buket Özkaya, Patrick Solé:
Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9. ISIT 2019: 2898-2902 - [i7]Martianus Frederic Ezerman, San Ling, Buket Özkaya, Patrick Solé:
Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9. CoRR abs/1906.04964 (2019) - [i6]Martianus Frederic Ezerman, San Ling, Buket Özkaya, Jareena Tharnnukhroh:
Spectral Bounds for Quasi-Twisted Codes. CoRR abs/1906.04967 (2019) - 2018
- [j9]Cem Güneri, Buket Özkaya, Selcen Sayici:
On Linear Complementary Pair of n D Cyclic Codes. IEEE Commun. Lett. 22(12): 2404-2406 (2018) - [j8]Claude Carlet, Cem Güneri, Ferruh Özbudak, Buket Özkaya, Patrick Solé:
On Linear Complementary Pairs of Codes. IEEE Trans. Inf. Theory 64(10): 6583-6589 (2018) - 2017
- [j7]Adel Alahmadi, Cem Güneri, Buket Özkaya, Hatoon Shohaib, Patrick Solé:
On self-dual double negacirculant codes. Discret. Appl. Math. 222: 205-212 (2017) - [j6]Cem Güneri, Ferruh Özbudak, Buket Özkaya, Elif Saçikara, Zahra Sepasdar, Patrick Solé:
Structure and performance of generalized quasi-cyclic codes. Finite Fields Their Appl. 47: 183-202 (2017) - [j5]Steven T. Dougherty, Jon-Lark Kim, Buket Özkaya, Lin Sok, Patrick Solé:
The combinatorics of LCD codes: linear programming bound and orthogonal matrices. Int. J. Inf. Coding Theory 4(2/3): 116-128 (2017) - [j4]Jean-Claude Belfiore, Cem Güneri, Buket Özkaya:
Quasi-Cyclic Subcodes of Cyclic Codes. SIAM J. Discret. Math. 31(2): 1454-1475 (2017) - [i5]Cem Güneri, Ferruh Özbudak, Buket Özkaya, Elif Saçikara, Zahra Sepasdar, Patrick Solé:
Structure and Performance of Generalized Quasi-Cyclic Codes. CoRR abs/1702.00153 (2017) - [i4]Adel Alahmadi, Cem Güneri, Buket Özkaya, Hatoon Shohaib, Patrick Solé:
On linear complementary-dual multinegacirculant codes. CoRR abs/1703.03115 (2017) - 2016
- [j3]Ferruh Özbudak, Buket Özkaya:
A minimum distance bound for quasi-nD-cyclic codes. Finite Fields Their Appl. 41: 193-222 (2016) - [j2]Cem Güneri, Buket Özkaya, Patrick Solé:
Quasi-cyclic complementary dual codes. Finite Fields Their Appl. 42: 67-80 (2016) - [j1]Cem Güneri, Buket Özkaya:
Multidimensional Quasi-Cyclic and Convolutional Codes. IEEE Trans. Inf. Theory 62(12): 6772-6785 (2016) - [i3]Jean-Claude Belfiore, Cem Güneri, Buket Özkaya:
Quasi-cyclic subcodes of cyclic codes. CoRR abs/1603.05063 (2016) - 2015
- [i2]Steven T. Dougherty, Jon-Lark Kim, Buket Özkaya, Lin Sok, Patrick Solé:
The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices. CoRR abs/1506.01955 (2015) - [i1]Cem Güneri, Buket Özkaya, Patrick Solé:
Quasi-Cyclic Complementary Dual Code. CoRR abs/1506.01971 (2015)
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-07 01:20 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:
