On the distribution of de Bruijn sequences of low complexity
From MaRDI portal
Publication:1069308
DOI10.1016/0097-3165(85)90074-3zbMATH Open0583.68036OpenAlexW1986762795MaRDI QIDQ1069308FDOQ1069308
Authors: Tuvi Etzion 
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
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Recurrences (11B37)
Cites Work
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- 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
- On the distribution of de Bruijn sequences of given complexity
Cited In (8)
- Title not available (Why is that?)
- Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
- On the distribution of de Bruijn sequences of given complexity
- On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
- ``Periods of de Bruijn sequences
- Construction of de Bruijn sequences of minimal complexity
- On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators
- A generalized recursive construction for de Bruijn sequences
This page was built for publication: On the distribution of de Bruijn sequences of low complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069308)
