On the classification of deBruijn sequences
From MaRDI portal
Recommendations
Cites work
- A proof of Golomb's conjecture for the de Bruijn graph
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
- On the classification of deBruijn sequences
- On the cycles and adjacencies in the complementary circulating register
Cited in
(18)- De Bruijn sequences, irreducible codes and cyclotomy
- The analysis of de Bruijn sequences of non-extremal weight
- The adjacency graphs of FSRs with a class of affine characteristic functions
- Classification of de Bruijn-based labeled digraphs
- Construction of de Bruijn sequences from product of two irreducible polynomials
- On the classification of deBruijn sequences
- On extending de Bruijn sequences
- Binary de Bruijn cycles under different equivalence relations
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- Properties of the cycles that contain all vectors of weight k
- scientific article; zbMATH DE number 5016615 (Why is no real title available?)
- On the quadratic spans of DeBruijn sequences
- scientific article; zbMATH DE number 2141530 (Why is no real title available?)
- The adjacency graphs of some feedback shift registers
- Bijections in de Bruijn graphs.
- Classification of base sequences \(\text{BS}(n+1,n)\)
- Efficient methods of constructing shorthand universal cycles for permutations
- Longest subsequences shared by two de Bruijn sequences
This page was built for publication: On the classification of deBruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910540)