Generalized cycle joining method and its application to the construction of long-period Galois NFSRs
From MaRDI portal
Recommendations
Cites work
- A Class of de Bruijn Sequences
- A Scalable Method for Constructing Galois NLFSRs With Period 2ⁿ-1 Using Cross-Join Pairs
- A Transformation From the Fibonacci to the Galois NLFSRs
- Algorithms for the generation of full-length shift- register sequences
- An algorithm for constructing a fastest Galois NLFSR generating a given sequence
- Boolean functions and their applications in cryptography
- Construction for de Bruijn sequences with large stage
- Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
- De Bruijn sequences, irreducible codes and cyclotomy
- Efficient Construction of Cross-Join Pairs in a Product of Primitive Polynomials of Pairwise-Coprime Degrees
- Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs
- Grain-like structures with minimal and maximal period sequences
- Graph theory with applications
- scientific article; zbMATH DE number 6900646 (Why is no real title available?)
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- On the cycle structure of some nonlinear shift register sequences
- Periods on two kinds of nonlinear feedback shift registers with time varying feedback functions
- Shift Register Sequences
- The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials
- The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
Cited in
(3)
This page was built for publication: Generalized cycle joining method and its application to the construction of long-period Galois NFSRs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651918)