Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Ferruh Özbudak
E-mail
ozbudak@metu.edu.tr
Department
Department of Mathematics
ORCID
0000-0002-1694-9283
Scopus Author ID
6603589033
Web of Science Researcher ID
AAZ-6893-2020
Publications
Theses Advised
Open Courses
Projects
New distance bounds for quasi-cyclic codes
Özkaya, Buket; Özbudak, Ferruh (2024-07-01)
Quasi-twisted codes as contractions of quasi-cyclic codes
Özkaya, Buket; Özbudak, Ferruh (2023-10-01)
Classification of some quadrinomials over finite fields of odd characteristic
Özbudak, Ferruh; Gulmez Temur, B. or Temur (2023-03-01)
In this paper, we completely determine all necessary and sufficient conditions such that the polynomialf(x)=x3+axq+2+bx2q+1+cx3q" role="presentation" style="margin: 0px; padding: 0px; display: inline-block; line-height: no...
Sonlu cisimler üzerindeki x^k-cx-d polinomlarının iki uygulaması üzerine ve daha fazlası
İrimağzı, Canberk; Özbudak, Ferruh (Springer, Cham, 2023-1-11)
For integers k∈[2,q−2] coprime to q−1 , we first bound the number of zeroes of the family of polynomials xk−cx−d∈Fq[x] where q=2n such that q−1 is a prime or q=3n such that (q−1)/2 is a prime. This gives us bounds on...
Boomerang uniformity of power permutations and algebraic curves over F2n
Mesnager, Sihem; Özbudak, Ferruh (2023-01-01)
We obtain the Boomerang Connectivity Table of power permutations F(x)=x2m-1 of F2n with m ∈ {3, n-1/2, n+1/2, n-2}. In particular, we obtain the Boomerang uniformity and the Boomerang uniformity set of F(x) at b∈F2n\F2. Mo...
On two applications of polynomials x^k-cx-d over finite fields and more
İrimağzı, Canberk; Özbudak, Ferruh (Springer, Cham, 2023-01-01)
For integers k∈[2,q−2] coprime to q−1 , we first bound the number of zeroes of the family of polynomials xk−cx−d∈Fq[x] where q=2n such that q−1 is a prime or q=3n such that (q−1)/2 is a prime. This gives us bounds on...
Complete characterization of some permutation polynomials of the form xr(1+axs1(q-1)+bxs2(q-1)) over Fq2
Özbudak, Ferruh; Temür, Burcu Gülmez (2023-01-01)
We completely characterize all permutation trinomials of the form f(x) = x3(1 + axq-1+ bx2(q-1)) over Fq2, where a,b∈Fq∗ and all permutation trinomials of the form f(x) = x3(1 + bx2(q-1)+ cx3(q-1)) over Fq2, where b,c∈Fq∗ ...
The c-differential uniformity of the perturbed inverse function via a trace function Tr(x2x+1)
Kaytancı, Kübra; Özbudak, Ferruh (2023-01-01)
Differential uniformity is one of the most crucial concepts in cryptography. Recently Ellingsen et al. (IEEE Trans Inf Theory 66:5781–5789, 2020) introduced a new concept, the c-Difference Distribution Table and the c-diff...
On subfield subcodes obtained from restricted evaluation codes
Güneri, Cem; Özbudak, Ferruh; Sayıcı, Selcen (2023-01-01)
Galindo et al. introduced a class of codes which are obtained by evaluation of polynomials at the roots of a trace map (Galindo et al. in IEEE Trans Inform Theory 65: 2593–2602, 2019). Via subfield subcodes, this construct...
Optimal Binary Linear Complementary Pairs of Codes
Choi, Whan-Hyuk; GÜNERİ, CEM; Kim, Jon-Lark; Özbudak, Ferruh (2022-11-01)
A pair of linear codes (C, D) of length n over F-q is called a linear complementary pair (LCP) if their direct sum yields the full space F-q(n). By a result of Carlet et al. (2019), the best security parameters of binary L...
F
P
1
2
3
4
5
6
7
8
9
10
N
E
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX