Pages that link to "Item:Q3336716"
From MaRDI portal
The following pages link to Algorithms for the generation of full-length shift- register sequences (Q3336716):
Displayed 20 items.
- Generation of full cycles by a composition of NLFSRs (Q398953) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- The adjacency graphs of some feedback shift registers (Q510426) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- An algorithm for generating shift-register cycles (Q1081585) (← links)
- Universal circuit matrix for adjacency graphs of feedback functions (Q1318845) (← links)
- Clues to the hidden nature of de Bruijn sequences (Q1570092) (← links)
- The adjacency graphs of FSRs with a class of affine characteristic functions (Q1654491) (← links)
- Construction of de Bruijn sequences from product of two irreducible polynomials (Q1696134) (← links)
- An interleaved method for constructing de Bruijn sequences (Q1720333) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Self-dual sequences (Q1821784) (← links)
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR (Q2007704) (← links)
- An efficiently generated family of binary de Bruijn sequences (Q2022156) (← links)
- Construction for de Bruijn sequences with large stage (Q2407716) (← links)
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials (Q2414937) (← links)
- Test sequence construction using minimum information on the tested system (Q2498283) (← links)
- Constructing de Bruijn Sequences Based on a New Necessary Condition (Q4983540) (← links)
- On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs (Q5114859) (← links)
- Nonsingular Polynomials from Feedback Shift Registers (Q5384127) (← links)