Ferruh Özbudak

1.6k total citations
137 papers, 816 citations indexed

About

Ferruh Özbudak is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Ferruh Özbudak has authored 137 papers receiving a total of 816 indexed citations (citations by other indexed papers that have themselves been cited), including 129 papers in Artificial Intelligence, 70 papers in Electrical and Electronic Engineering and 46 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Ferruh Özbudak's work include Coding theory and cryptography (126 papers), graph theory and CDMA systems (65 papers) and Finite Group Theory Research (44 papers). Ferruh Özbudak is often cited by papers focused on Coding theory and cryptography (126 papers), graph theory and CDMA systems (65 papers) and Finite Group Theory Research (44 papers). Ferruh Özbudak collaborates with scholars based in Türkiye, China and Singapore. Ferruh Özbudak's co-authors include Cem Güneri̇, Patrick Solé, Henning Stichtenoth, Minjia Shi, Sihem Mesnager, Harald Niederreiter, Murat Cenk, Buket Özkaya, Claude Carlet and San Ling and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Access and Information Sciences.

In The Last Decade

Ferruh Özbudak

121 papers receiving 781 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ferruh Özbudak Türkiye	15	741	409	237	201	190	137	816
Ruud Pellikaan Netherlands	16	775 1.0×	404 1.0×	205 0.9×	151 0.8×	291 1.5×	43	910
Longjiang Qu China	18	1000 1.3×	679 1.7×	109 0.5×	147 0.7×	166 0.9×	105	1.0k
Xiwang Cao China	15	1.0k 1.4×	596 1.5×	278 1.2×	191 1.0×	334 1.8×	149	1.1k
Anne Canteaut France	20	1.4k 1.9×	810 2.0×	157 0.7×	162 0.8×	217 1.1×	73	1.5k
Gary McGuire Ireland	16	594 0.8×	427 1.0×	62 0.3×	155 0.8×	121 0.6×	57	678
Xiang‐dong Hou United States	19	1.1k 1.5×	752 1.8×	121 0.5×	397 2.0×	233 1.2×	99	1.2k
Victor Zinoviev Russia	14	901 1.2×	750 1.8×	158 0.7×	255 1.3×	160 0.8×	79	946
Hans Dobbertin Germany	19	1.3k 1.7×	853 2.1×	136 0.6×	186 0.9×	351 1.8×	41	1.4k
Nian Li China	18	1.1k 1.5×	860 2.1×	258 1.1×	204 1.0×	216 1.1×	78	1.2k

Countries citing papers authored by Ferruh Özbudak

Since Specialization

Citations

This map shows the geographic impact of Ferruh Özbudak's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ferruh Özbudak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ferruh Özbudak more than expected).

Fields of papers citing papers by Ferruh Özbudak

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ferruh Özbudak. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ferruh Özbudak. The network helps show where Ferruh Özbudak may publish in the future.

Co-authorship network of co-authors of Ferruh Özbudak

This figure shows the co-authorship network connecting the top 25 collaborators of Ferruh Özbudak. A scholar is included among the top collaborators of Ferruh Özbudak based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ferruh Özbudak. Ferruh Özbudak is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Shi, Minjia, et al.. (2025). Determining the Covering Radius of All Generalized Zetterberg Codes in Odd Characteristic. IEEE Transactions on Information Theory. 71(5). 3602–3613.

Özbudak, Ferruh, et al.. (2025). Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes. Cryptography and Communications. 17(4). 695–708.

Shi, Minjia, Xiufang Bian, Ferruh Özbudak, & Patrick Solé. (2025). Bound on the minimum distance of double circulant cubic residue codes. Finite Fields and Their Applications. 105. 102605–102605. 1 indexed citations

Shi, Minjia, et al.. (2024). Additive cyclic codes over 𝔽q3. Journal of Algebra and Its Applications. 24(9). 1 indexed citations

Özbudak, Ferruh & Buket Özkaya. (2024). New distance bounds for quasi-cyclic codes. Designs Codes and Cryptography. 92(12). 3981–4009. 1 indexed citations

Shi, Minjia, Denis S. Krotov, & Ferruh Özbudak. (2024). Constructing MRD codes by switching. Journal of Combinatorial Designs. 32(5). 219–237. 1 indexed citations

Sălăgean, Ana & Ferruh Özbudak. (2023). Further constructions and characterizations of generalized almost perfect nonlinear functions. Cryptography and Communications. 15(6). 1117–1127.

Shi, Minjia, Xiaoxiao Li, Denis S. Krotov, & Ferruh Özbudak. (2023). Quasi-Cyclic Perfect Codes in Doob Graphs and Special Partitions of Galois Rings. IEEE Transactions on Information Theory. 69(9). 5597–5603. 1 indexed citations

Özbudak, Ferruh, et al.. (2023). Classification of some quadrinomials over finite fields of odd characteristic. Finite Fields and Their Applications. 87. 102158–102158. 6 indexed citations

10.

Mesnager, Sihem, et al.. (2021). Secondary constructions of (non)weakly regular plateaued functions over finite fields. TURKISH JOURNAL OF MATHEMATICS. 45(5). 2295–2306. 6 indexed citations

11.

Sălăgean, Ana & Ferruh Özbudak. (2020). Counting Boolean functions with faster points. Designs Codes and Cryptography. 88(9). 1867–1883.

12.

Mesnager, Sihem, et al.. (2018). Linear codes from weakly regular plateaued functions and their secret sharing schemes. Designs Codes and Cryptography. 87(2-3). 463–480. 57 indexed citations

13.

Mesnager, Sihem, et al.. (2018). On q-ary plateaued functions over Fq and their explicit characterizations. European Journal of Combinatorics. 80. 71–81. 4 indexed citations

14.

Akleylek, Sedat, et al.. (2013). On the arithmetic operations over finite fields of characteristic three with low complexity. Journal of Computational and Applied Mathematics. 259. 546–554. 1 indexed citations

15.

Meidl, Wilfried & Ferruh Özbudak. (2008). Linear complexity over Fq and over Fqm for linear recurring sequences. Finite Fields and Their Applications. 15(1). 110–124. 5 indexed citations

16.

Ling, San & Ferruh Özbudak. (2007). Some constructions of (t,m,s)-nets with improved parameters. Finite Fields and Their Applications. 14(3). 658–675. 1 indexed citations

17.

Ling, San & Ferruh Özbudak. (2005). Improved p-ary Codes and Sequence Families from Galois Rings of Characteristic p2. SIAM Journal on Discrete Mathematics. 19(4). 1011–1028. 1 indexed citations

18.

Yaşar, Osman, et al.. (2004). On the applied Mathematics of discrete Tomography. 9(5).

19.

Özbudak, Ferruh & Henning Stichtenoth. (1999). Curves with Many Points and Configurations of Hyperplanes over Finite Fields. Finite Fields and Their Applications. 5(4). 436–449. 7 indexed citations

20.

Özbudak, Ferruh. (1998). Codes on Superelliptic Curves. DergiPark (Istanbul University). 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact