Pages that link to "Item:Q3363230"

The following pages link to An efficient algorithm for the generation of DeBruijn cycles (Q3363230):

Displaying 14 items.

• The adjacency graphs of some feedback shift registers (Q510426) (← links)
• De Bruijn sequences, irreducible codes and cyclotomy (Q1126191) (← links)
• Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← 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)
• A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
• An efficiently generated family of binary de Bruijn sequences (Q2022156) (← links)
• Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
• A number theoretic view on binary shift registers (Q2088954) (← links)
• Novel way to research nonlinear feedback shift register (Q2335934) (← links)
• Construction for de Bruijn sequences with large stage (Q2407716) (← links)
• Test sequence construction using minimum information on the tested system (Q2498283) (← links)
• Cryptographically Strong de Bruijn Sequences with Large Periods (Q3455491) (← links)