Pages that link to "Item:Q4053495"
From MaRDI portal
The following pages link to Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register (Q4053495):
Displaying 10 items.
- An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
- A class of nonlinear de Bruijn cycles (Q1219284) (← links)
- Universal circuit matrix for adjacency graphs of feedback functions (Q1318845) (← links)
- The analysis of de Bruijn sequences of non-extremal weight (Q1584352) (← links)
- On the cycles and adjacencies in the complementary circulating register (Q1901035) (← links)
- On the classification of deBruijn sequences (Q1910540) (← links)
- On the structure property of PCR's adjacency graph with a prime order and its application of constructing M-sequences (Q2057156) (← links)
- A number theoretic view on binary shift registers (Q2088954) (← links)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255) (← links)
- Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) (← links)