AbstractIt is well known that a de Bruijn sequence over F2 has the minimal polynomial (x+1)d, where 2n-1+n⩽d⩽2n-1. We study the minimal polynomials of the modified de Bruijn sequences
AbstractIf s = (s0, s1,…, s2n−1) is a binary de Bruijn sequence of span n, then it has been shown th...
AbstractThis work gives an alternative proof for the theorem of Fredricksen and Maiorana [Discrete M...
Soit un langage composée par tous les mots d une longueur donnée n. Un cycle de de Bruijn d ordre n ...
AbstractIt is well known that a de Bruijn sequence over F2 has the minimal polynomial (x+1)d, where ...
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing...
AbstractThe paper establishes a connection between the theory of permutation polynomials and the que...
AbstractIt has been conjectured that over any non-prime finite field Fpmand for any positive integer...
AbstractOrder n modified de Bruijn sequences are created by removing a single zero from the longest ...
AbstractWe give a complete resolution to a conjecture regarding the characterisation of linear compl...
A way of designing de-Bruijn sequence generators is presented. The design is based on modifying a ge...
AbstractWe use the cycle join algorithm to generate de Bruijn sequences from irreducible cyclic code...
AbstractThe distribution γ(c, n) of de Bruijn sequences of order n and linear complexity c is invest...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
AbstractIf s = (s0, s1,…, s2n−1) is a binary de Bruijn sequence of span n, then it has been shown th...
AbstractThis work gives an alternative proof for the theorem of Fredricksen and Maiorana [Discrete M...
Soit un langage composée par tous les mots d une longueur donnée n. Un cycle de de Bruijn d ordre n ...
AbstractIt is well known that a de Bruijn sequence over F2 has the minimal polynomial (x+1)d, where ...
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing...
AbstractThe paper establishes a connection between the theory of permutation polynomials and the que...
AbstractIt has been conjectured that over any non-prime finite field Fpmand for any positive integer...
AbstractOrder n modified de Bruijn sequences are created by removing a single zero from the longest ...
AbstractWe give a complete resolution to a conjecture regarding the characterisation of linear compl...
A way of designing de-Bruijn sequence generators is presented. The design is based on modifying a ge...
AbstractWe use the cycle join algorithm to generate de Bruijn sequences from irreducible cyclic code...
AbstractThe distribution γ(c, n) of de Bruijn sequences of order n and linear complexity c is invest...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
AbstractOrder n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedba...
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
AbstractIf s = (s0, s1,…, s2n−1) is a binary de Bruijn sequence of span n, then it has been shown th...
AbstractThis work gives an alternative proof for the theorem of Fredricksen and Maiorana [Discrete M...
Soit un langage composée par tous les mots d une longueur donnée n. Un cycle de de Bruijn d ordre n ...
DOI
Add to ORKG