Buket Özkaya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Buket Özkaya has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Ferruh Özbudak
FENS, Sabancı University, Istanbul, Turkey
10 shared publications - San Ling
Nanyang Technological University
7 shared publications - Cem Güneri
Faculty of Engineering and Natural Sciences, Sabancı University, Istanbul, Turkey
4 shared publications - Markus Grassl
International Centre for Theory of Quantum Technologies, University of Gdansk, Gdask, Poland
4 shared publications - Patrick Solé
I2M (CNRS, University of Aix-Marseille), Marseilles, France
4 shared publications - Burcu Gülmez Temür
Department of Mathematics, Atılım University, Ankara, Turkey
3 shared publications
Latest Publications
- Open Access
- 1 September 2026
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in TURKISH JOURNAL OF MATHEMATICS
- Vol. 50 (5) , 842-860
Generalized spectral bound for quasi-twisted codes
Minimum distance bounds play a central role in the analysis of algebraic codes. For cyclic and constacyclic codes, several bounds based on their zero set have been developed. However, analogous results for quasi-twisted (QT) codes are comparatively limited. In this paper, we further investigate the spectral theory of QT codes and derive a general spectral bound on their minimum distance. Our bound unifies and generalizes previously known spectral bounds for quasi-cyclic (QC) and QT codes, and contains them as special cases. We present a new proof technique and show that the bound can be formulated with respect to an arbitrary subset of eigenvalues, thereby extending its applicability to the largest possible setting. Numerical examples and simulations demonstrate that the proposed bound often improves upon the Jensen bound and earlier spectral bounds.
- 1 September 2026
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in TURKISH JOURNAL OF MATHEMATICS
- Vol. 50 (5) , 842-860
Open AccessGeneralized spectral bound for quasi-twisted codes
Minimum distance bounds play a central role in the analysis of algebraic codes. For cyclic and constacyclic codes, several bounds based on their zero set have been developed. However, analogous results for quasi-twisted (QT) codes are comparatively limited. In this paper, we further investigate the spectral theory of QT codes and derive a general spectral bound on their minimum distance. Our bound unifies and generalizes previously known spectral bounds for quasi-cyclic (QC) and QT codes, and contains them as special cases. We present a new proof technique and show that the bound can be formulated with respect to an arbitrary subset of eigenvalues, thereby extending its applicability to the largest possible setting. Numerical examples and simulations demonstrate that the proposed bound often improves upon the Jensen bound and earlier spectral bounds.
- 8 July 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 117
On an open problem on permutation polynomials from self-reciprocal polynomials
- 8 July 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 117
On an open problem on permutation polynomials from self-reciprocal polynomials
- 29 May 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (11)
Generator matrices of quasi-cyclic codes
- 29 May 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (11)
Generator matrices of quasi-cyclic codes
- 13 March 2026
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- p. 1-37
Extended LP bound for LCD codes and new binary and ternary LCD codes
- 13 March 2026
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- p. 1-37
Extended LP bound for LCD codes and new binary and ternary LCD codes
- Open Access
- 3 February 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (6)
PIR Schemes from nD-Cyclic and nD-Constacyclic Codes and Their Monomial Equivalence
Private Information Retrieval (PIR) scheme aims to retrieve data from a database without revealing any details about the identity of the data. The PIR scheme for coded storage systems with colluding servers gives a better PIR rate when the storage code and retrieval code have transitive automorphism groups. In this work, we study the transitivity of n D-cyclic codes and then PIR schemes from them together with several examples of n D-cyclic codes with better PIR rates. Then, we show the monomial equivalence between n D-cyclic codes and certain n D-constacyclic codes, which can be used as an alternative family of transitive codes.
- 3 February 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (6)
Open AccessPIR Schemes from nD-Cyclic and nD-Constacyclic Codes and Their Monomial Equivalence
Private Information Retrieval (PIR) scheme aims to retrieve data from a database without revealing any details about the identity of the data. The PIR scheme for coded storage systems with colluding servers gives a better PIR rate when the storage code and retrieval code have transitive automorphism groups. In this work, we study the transitivity of n D-cyclic codes and then PIR schemes from them together with several examples of n D-cyclic codes with better PIR rates. Then, we show the monomial equivalence between n D-cyclic codes and certain n D-constacyclic codes, which can be used as an alternative family of transitive codes.
- Open Access
Generalized Spectral Bound for Quasi-Twisted Codes
Semenov and Trifonov [22] developed a spectral theory for quasi-cyclic codes and formulated a BCH-like minimum distance bound. Their approach was generalized by Zeh and Ling [24], by using the HT bound. The first spectral bound for quasi-twisted codes appeared in [7], which generalizes Semenov-Trifonov and Zeh-Ling bounds, but its overall performance was observed to be worse than the Jensen bound. More recently, an improved spectral bound for quasi-cyclic codes was proposed in [15], which outperforms the Jensen bound in many cases. In this paper, we adopt this approach to quasi-twisted case and we show that this new generalized spectral bound provides tighter lower bounds on the minimum distance compared to the Jensen and Ezerman et. al. bounds.
Open AccessGeneralized Spectral Bound for Quasi-Twisted Codes
Semenov and Trifonov [22] developed a spectral theory for quasi-cyclic codes and formulated a BCH-like minimum distance bound. Their approach was generalized by Zeh and Ling [24], by using the HT bound. The first spectral bound for quasi-twisted codes appeared in [7], which generalizes Semenov-Trifonov and Zeh-Ling bounds, but its overall performance was observed to be worse than the Jensen bound. More recently, an improved spectral bound for quasi-cyclic codes was proposed in [15], which outperforms the Jensen bound in many cases. In this paper, we adopt this approach to quasi-twisted case and we show that this new generalized spectral bound provides tighter lower bounds on the minimum distance compared to the Jensen and Ezerman et. al. bounds.
- Open Access
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 194149-194155
Optimum Distance Cyclic H -Orbit Full Flag Codes
Flag codes, introduced as a special class of nested subspace codes, have recently attracted significant attention in the research community. In this work, we present constructions of optimum-distance cyclic H-orbit full flag codes, where H is a cyclic subgroup of F∗qn of order at most qn/2 + 1. Our aim is to extend certain results from [10] to the framework of flag codes. The proposed constructions, unlike the work [4], achieve full flags with optimum distance and either maximal or best-possible size, depending on the parity of the base field. We also provide explicit examples that demonstrate the structure of our codes. Furthermore, for the case of even base field size, we prove -via intricate arithmetical arguments- that our construction is unique under certain conditions.
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 194149-194155
Open AccessOptimum Distance Cyclic H -Orbit Full Flag Codes
Flag codes, introduced as a special class of nested subspace codes, have recently attracted significant attention in the research community. In this work, we present constructions of optimum-distance cyclic H-orbit full flag codes, where H is a cyclic subgroup of F∗qn of order at most qn/2 + 1. Our aim is to extend certain results from [10] to the framework of flag codes. The proposed constructions, unlike the work [4], achieve full flags with optimum distance and either maximal or best-possible size, depending on the parity of the base field. We also provide explicit examples that demonstrate the structure of our codes. Furthermore, for the case of even base field size, we prove -via intricate arithmetical arguments- that our construction is unique under certain conditions.
- Open Access
- 24 June 2025
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 54 (3) , 797-806
On some permutation trinomials in characteristic three
In this paper, we determine the permutation properties of the polynomial $x^3+x^{q+2}-x^{4q-1}$ over the finite field $\mathbb{F}_{q^2}$ in characteristic three. Moreover, we consider the trinomials of the form $x^{4q-1}+x^{2q+1} \pm x^{3}$. In particular, we first show that $x^3+x^{q+2}-x^{4q-1}$ permutes $\mathbb{F}_{q^2}$ with $q=3^m$ if and only if $m$ is odd. This enables us to show that the sufficient condition in [34, Theorem 4] is also necessary. Next, we prove that $x^{4q-1}+x^{2q+1} - x^{3}$ permutes $\mathbb{F}_{q^2}$ with $q=3^m$ if and only if $m\not\equiv 0 \pmod 4$. Consequently, we prove that the sufficient condition in [20, Theorem 3.2] is also necessary. Finally, we investigate the trinomial $x^{4q-1}+x^{2q+1} + x^{3}$ and show that it is never a permutation polynomial of $\mathbb{F}_{q^2}$ in any characteristic. All the polynomials considered in this work are not quasi-multiplicative equivalent to any known class of permutation trinomials.- 24 June 2025
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 54 (3) , 797-806
Open AccessOn some permutation trinomials in characteristic three
In this paper, we determine the permutation properties of the polynomial $x^3+x^{q+2}-x^{4q-1}$ over the finite field $\mathbb{F}_{q^2}$ in characteristic three. Moreover, we consider the trinomials of the form $x^{4q-1}+x^{2q+1} \pm x^{3}$. In particular, we first show that $x^3+x^{q+2}-x^{4q-1}$ permutes $\mathbb{F}_{q^2}$ with $q=3^m$ if and only if $m$ is odd. This enables us to show that the sufficient condition in [34, Theorem 4] is also necessary. Next, we prove that $x^{4q-1}+x^{2q+1} - x^{3}$ permutes $\mathbb{F}_{q^2}$ with $q=3^m$ if and only if $m\not\equiv 0 \pmod 4$. Consequently, we prove that the sufficient condition in [20, Theorem 3.2] is also necessary. Finally, we investigate the trinomial $x^{4q-1}+x^{2q+1} + x^{3}$ and show that it is never a permutation polynomial of $\mathbb{F}_{q^2}$ in any characteristic. All the polynomials considered in this work are not quasi-multiplicative equivalent to any known class of permutation trinomials. - 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (1) , 499-517
Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes
Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices of the inner product to also cover the symplectic and trace-symplectic inner products, in addition to the original Hermitian one. A refined lower bound on the minimum distance of the resulting quantum codes is established and illustrated. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (1) , 499-517
Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes
Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices of the inner product to also cover the symplectic and trace-symplectic inner products, in addition to the original Hermitian one. A refined lower bound on the minimum distance of the resulting quantum codes is established and illustrated. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.
- Open Access
- 14 August 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (12) , 3981-4009
New distance bounds for quasi-cyclic codes
We consider the minimum weight of codewords in a quasi-cyclic code and characterize the estimate in its most general setup using their concatenated structure. The new bound we derive generalizes the Jensen and Güneri–Özbudak bounds and it holds for the more general class of multilevel concatenated codes.
- 14 August 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (12) , 3981-4009
Open AccessNew distance bounds for quasi-cyclic codes
We consider the minimum weight of codewords in a quasi-cyclic code and characterize the estimate in its most general setup using their concatenated structure. The new bound we derive generalizes the Jensen and Güneri–Özbudak bounds and it holds for the more general class of multilevel concatenated codes.