Pages that link to "Item:Q2977089"
From MaRDI portal
The following pages link to Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials (Q2977089):
Displaying 16 items.
- The adjacency graphs of some feedback shift registers (Q510426) (← links)
- Longest subsequences shared by two de Bruijn sequences (Q780381) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← 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)
- Preliminary results on the minimal polynomial of modified de Bruijn sequences (Q1696767) (← links)
- An interleaved method for constructing de Bruijn sequences (Q1720333) (← links)
- The minimal polynomials of modified de Bruijn sequences revisited (Q1994951) (← links)
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR (Q2007704) (← links)
- On greedy algorithms for binary de Bruijn sequences (Q2081554) (← links)
- A new upper bound on the order of affine sub-families of NFSRs (Q2179656) (← links)
- Construction for de Bruijn sequences with large stage (Q2407716) (← links)
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials (Q2414937) (← links)
- Constructing de Bruijn Sequences Based on a New Necessary Condition (Q4983540) (← links)
- Nonsingular Polynomials from Feedback Shift Registers (Q5384127) (← links)
- Generalized cycle joining method and its application to the construction of long-period Galois NFSRs (Q6651918) (← links)