My works are mainly about coding theory and algebraic-geometric codes. In my doctoral studies, I examine the parameters of codes on weighted projective spaces and try to understand the relationship of the parameters with the algebraic invariants of the codes.
Also, I researched the family complexity ( a measure of any sequence) of Legendre sequences. In 2020, we present a new lower bound for the family complexity of Legendre sequences . And then I have experience in working with irreducible polynomials with two prescribed coefficients.
Publications
1. Yağmur Çakıroğlu and Oğuz Yayla. A new lower bound on the family complexity of Legendre sequences. AAECC (2020). https://doi.org/10.1007/s00200-020-00442-y
2. Yağmur Çakıroğlu, Oğuz Yayla and Emrah Sercan Yılmaz. The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace. Des. Codes Cryptogr. (2022). https://doi.org/10.1007/s10623-022-01088-2
Preprints
Yağmur Çakıroğlu, Mesut Şahin. Algebraic Invariants of Codes on Weighted Projective Spaces. (2022) https://arxiv.org/abs/2301.05313