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

DOI10.1109/TIT.2010.2046250zbMath1366.94448MaRDI QIDQ5281471

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)

Related Items (9)

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