Add to ORKGWe introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields exhibit a large linear complexity. For Sidel'nikov sequences over $\F_8$ we provide exact values for their linear complexity
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
Since the $\F_q$-linear spaces $\F_q^m$ and $\F_{q^m}$ are isomorphic, an $m$-fold multisequence $\m...
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that sev...
AbstractWe introduce a generalization of Sidel’nikov sequences for arbitrary finite fields. We show ...
Based on a result of Hao Chen in 2006 we present a general procedure how to reduce the determination...
The $d$-ary Sidel'nikov sequence $S = s_0, s_1 \ldots$ of period $q-1$ for a prime power $q = p^m$ i...
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al....
AbstractWe give a complete resolution to a conjecture regarding the characterisation of linear compl...
We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polyn...
AbstractComplexity measures for sequences of elements of a finite field play an important role in cr...
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polyno...
We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue...
AbstractThe paper establishes a connection between the theory of permutation polynomials and the que...
Several fast algorithms for the determination of the linear complexity of $d$-periodic sequences ove...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
Since the $\F_q$-linear spaces $\F_q^m$ and $\F_{q^m}$ are isomorphic, an $m$-fold multisequence $\m...
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that sev...
AbstractWe introduce a generalization of Sidel’nikov sequences for arbitrary finite fields. We show ...
Based on a result of Hao Chen in 2006 we present a general procedure how to reduce the determination...
The $d$-ary Sidel'nikov sequence $S = s_0, s_1 \ldots$ of period $q-1$ for a prime power $q = p^m$ i...
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al....
AbstractWe give a complete resolution to a conjecture regarding the characterisation of linear compl...
We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polyn...
AbstractComplexity measures for sequences of elements of a finite field play an important role in cr...
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polyno...
We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue...
AbstractThe paper establishes a connection between the theory of permutation polynomials and the que...
Several fast algorithms for the determination of the linear complexity of $d$-periodic sequences ove...
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We der...
AbstractWe present a method for multiplication in finite fields which gives multiplication algorithm...
Since the $\F_q$-linear spaces $\F_q^m$ and $\F_{q^m}$ are isomorphic, an $m$-fold multisequence $\m...