Construction of de Bruijn sequences of minimal complexity
From MaRDI portal
Publication:3698698
Recommendations
- Linear complexity of de Bruijn sequences-old and new results
- On the distribution of de Bruijn sequences of low complexity
- On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
- Permutation polynomials, de Bruijn sequences, and linear complexity
- A generalized recursive construction for de Bruijn sequences
Cited in
(19)- Preliminary results on the minimal polynomial of modified de Bruijn sequences
- A recursive construction of nonbinary de Bruijn sequences
- Graphs with the unique path property: Structure, cycles, factors, and constructions
- Minimal polynomials of the modified de Bruijn sequences
- Minimum Eulerian circuits and minimum de Bruijn sequences
- Perfect factors in the de Bruijn graph
- Cryptographically Strong de Bruijn Sequences with Large Periods
- scientific article; zbMATH DE number 4083537 (Why is no real title available?)
- On the distribution of de Bruijn sequences of given complexity
- Minimal Polynomials of the Modified de Bruijn Sequences
- Constructing de Bruijn sequences by concatenating smaller universal cycles
- On some classes of nonlinear shift registers with the same cyclic structure
- scientific article; zbMATH DE number 1024022 (Why is no real title available?)
- Randomness and Representation of Span n Sequences
- On the \(k\)-error linear complexities of De Bruijn sequences
- Longest subsequences shared by two de Bruijn sequences
- On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
- Self-dual sequences
- On the distribution of de Bruijn sequences of low complexity
This page was built for publication: Construction of de Bruijn sequences of minimal complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698698)
