On the classification of deBruijn sequences
A deBruijn sequence of order \(n\) is a binary sequence with period length \(2^n\) which contains all binary \(n\)-tupels. The binary deBruijn graph \(B_n\) is a directed graph with \(2^n\) nodes, each labeled with a unique binary \(n\)-tupel, and an edge from node \(T= (t_0, t_1,\dots, t_{n- 1})\) to node \(U= (u_0, u_1,\dots, u_{n- 1})\) if and only if \((t_1, t_2,\dots, t_{n- 1})= (u_0, u_1,\dots, u_{n- 2})\). The deBruijn sequences of order \(n\) are divided into weight classes. Certain permutations of the edges of \(B_n\) correspond to permutations of deBruijn sequences. In this paper, symmetry groups for the weight classes of the deBruijn sequences are used to subdivide them into smaller equivalence classes. These groups are given for \(n\leq 7\) when the weight is minimal or maximal.
- 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
- 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)
