Finding Matching Initial States for Equivalent NLFSRs in the Fibonacci and the Galois Configurations

DOI10.1109/TIT.2010.2046250MaRDI QIDQ5281471zbMATHFDO

Authors Elena Dubrova

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs
• On Galois NFSRs equivalent to Fibonacci ones
• A Transformation From the Fibonacci to the Galois NLFSRs
• The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices
• Entropy of the Internal State of an FCSR in Galois Representation
• Synthesis of Finite State Algorithms in a Galois Field GF[pⁿ
• On equivalence classes of generalized Fibonacci sequences
• GKSL generators and digraphs: computing invariant states
• On the optimal utilization of all available states in the \(2^{n}\) moduli set

Cited in

(9)

• Complex systems with impulsive effects and logical dynamics: a brief overview
• Improved transformation algorithms for generalized Galois NLFSRs
• The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices
• On Galois NFSRs equivalent to Fibonacci ones
• Isomorphism and equivalence of Galois nonlinear feedback shift registers
• An Equivalence-Preserving Transformation of Shift Registers
• Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs
• A novel method for driven stability of NFSRs via STP
• Improved transformation between Fibonacci FSRs and Galois FSRs based on semi-tensor product

This page was built for publication: Finding Matching Initial States for Equivalent NLFSRs in the Fibonacci and the Galois Configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281471)