The adjacency graphs of FSRs with a class of affine characteristic functions

DOI10.1016/J.FFA.2018.05.004zbMath1422.94023OpenAlexW2805920467WikidataQ129800291 ScholiaQ129800291MaRDI QIDQ1654491

Yu-Jie Dong, Wen-Feng Qi, Tian Tian, Zhen Ma

Publication date: 8 August 2018

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2018.05.004

zbMATH Keywords

de Bruijn sequenceadjacency graphfeedback shift registers

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A recursive construction of nonbinary de Bruijn sequences
• On the classification of deBruijn 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
• The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials
• Algorithms for the generation of full-length shift- register sequences
• On the cycle structure of some nonlinear shift register sequences
• 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 FSRs with a class of affine characteristic functions