There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)

DOI10.1016/0097-3165(83)90060-2zbMath0518.05002OpenAlexW1983677142MaRDI QIDQ1053685

Richard A. Games

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90060-2

zbMATH Keywords

complexitybinary de Bruijn sequencelength of linear recursion

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Special sequences and polynomials (11B83)

Related Items

Further results on correlation functions of de Bruijn sequences ⋮ Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. ⋮ A new upper bound on the order of affine sub-families of NFSRs ⋮ Minimal polynomials of the modified de Bruijn sequences ⋮ The minimal polynomials of modified de Bruijn sequences revisited ⋮ On some classes of nonlinear shift registers with the same cyclic structure ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Minimal Polynomials of the Modified de Bruijn Sequences

Cites Work

• Unnamed Item
• On the complexities of de-Bruijn sequences
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers