AbstractIt has been conjectured that over any non-prime finite field Fpmand for any positive integer n, there exists a spannde Bruijn sequence over Fpmwhich has the minimum possible linear complexitypnm−1+n. We give a proof by construction that this conjecture is true
AbstractSequences with almost perfect linear complexity profile are of importance for the linear com...
We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polyn...
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polyno...
AbstractIt has been conjectured that over any non-prime finite field Fpmand for any positive integer...
AbstractWe give a complete resolution to a conjecture regarding the characterisation of linear compl...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN035006 / BLDSC - British Library D...
AbstractThe paper establishes a connection between the theory of permutation polynomials and the que...
AbstractIf s = (s0, s1,…, s2n−1) is a binary de Bruijn sequence of span n, then it has been shown th...
AbstractWe introduce a generalization of Sidel’nikov sequences for arbitrary finite fields. We show ...
AbstractThe distribution γ(c, n) of de Bruijn sequences of order n and linear complexity c is invest...
AbstractIt is well known that a de Bruijn sequence over F2 has the minimal polynomial (x+1)d, where ...
In this paper we provide a bound for the linear complexity of the so-called Naor-Reingold sequence o...
Abstract We discuss the linear complexity of a family of binary threshold sequence defined by the di...
Based on a result of Hao Chen in 2006 we present a general procedure how to reduce the determination...
An efficient algorithm for determining the linear complexity and the minimal polynomial of a sequenc...
AbstractSequences with almost perfect linear complexity profile are of importance for the linear com...
We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polyn...
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polyno...
AbstractIt has been conjectured that over any non-prime finite field Fpmand for any positive integer...
AbstractWe give a complete resolution to a conjecture regarding the characterisation of linear compl...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN035006 / BLDSC - British Library D...
AbstractThe paper establishes a connection between the theory of permutation polynomials and the que...
AbstractIf s = (s0, s1,…, s2n−1) is a binary de Bruijn sequence of span n, then it has been shown th...
AbstractWe introduce a generalization of Sidel’nikov sequences for arbitrary finite fields. We show ...
AbstractThe distribution γ(c, n) of de Bruijn sequences of order n and linear complexity c is invest...
AbstractIt is well known that a de Bruijn sequence over F2 has the minimal polynomial (x+1)d, where ...
In this paper we provide a bound for the linear complexity of the so-called Naor-Reingold sequence o...
Abstract We discuss the linear complexity of a family of binary threshold sequence defined by the di...
Based on a result of Hao Chen in 2006 we present a general procedure how to reduce the determination...
An efficient algorithm for determining the linear complexity and the minimal polynomial of a sequenc...
AbstractSequences with almost perfect linear complexity profile are of importance for the linear com...
We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polyn...
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polyno...
DOI
Add to ORKG