The adjacency graphs of some feedback shift registers
From MaRDI portal
Publication:510426
DOI10.1007/s10623-016-0187-6zbMath1370.94472OpenAlexW2292044371MaRDI QIDQ510426
Ming Li, Yupeng Jiang, Dong-Dai Lin
Publication date: 17 February 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0187-6
Related Items (4)
Construction for de Bruijn sequences with large stage ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Longest subsequences shared by two de Bruijn sequences
Cites Work
- Unnamed Item
- Unnamed Item
- A class of nonlinear de Bruijn cycles
- On the classification of deBruijn sequences
- On the largest affine sub-families of a family of NFSR sequences
- Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
- A Class of de Bruijn Sequences
- The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
- On cross joining de Bruijn sequences
- Linear Recurring Sequences
- Algorithms for the generation of full-length shift- register sequences
- An efficient algorithm for the generation of DeBruijn cycles
- On the cycle structure of some nonlinear shift register sequences
- A large class of nonlinear shift register sequences (Corresp.)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
This page was built for publication: The adjacency graphs of some feedback shift registers
