3 citations · 3 across the 7 of their papers we have counts for
4 papers · 1 filter
The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace
Yağmur Çakıroğlu, Oğuz Yayla, Emrah Sercan Yılmaz
We present the formula for the number of monic irreducible polynomials of degree over the finite field where the coefficients of and vanish for $n\g…
Improved lower bound on the family complexity of Legendre sequences
Yaǧmur Çakıroǧlu, Oǧuz Yayla
In this paper we study a family of binary Legendre sequences and its family complexity. Family complexity is a pseudorandomness measure introduced by Ahlswede et.~al.~in 2003. A lo…
Family complexity and cross-correlation measure for families of binary sequences
Arne Winterhof, Oğuz Yayla
We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\…
Non-Existence of Some Nearly Perfect Sequences, Near Butson-Hadamard Matrices, and Near Conference Matrices
Arne Winterhof, Oğuz Yayla, Volker Ziegler
In this paper we study the non-existence problem of (nearly) perfect (almost) -ary sequences via their connection to (near) Butson-Hadamard (BH) matrices and (near) conference m…