On the distribution of de Bruijn sequences of low complexity
From MaRDI portal
Publication:1069308
DOI10.1016/0097-3165(85)90074-3zbMath0583.68036OpenAlexW1986762795MaRDI QIDQ1069308
Publication date: 1985
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(85)90074-3
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Recurrences (11B37) Discrete mathematics in relation to computer science (68R99)
Related Items
Characterising the linear complexity of span 1 de Bruijn sequences over finite fields., On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
Cites Work
- On the complexities of de-Bruijn sequences
- On the distribution of de Bruijn sequences of given complexity
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers