On the cycle structure of some nonlinear shift register sequences

From MaRDI portal
Publication:3868778

DOI10.1016/S0019-9958(79)90708-3zbMath0431.68059MaRDI QIDQ3868778

No author found.

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)




Related Items

Grain-like structures with minimal and maximal period sequencesExistence of self-reverse-dual \(m\)-sequencesCryptographically Strong de Bruijn Sequences with Large PeriodsIsomorphism and equivalence of Galois nonlinear feedback shift registersOn the cycles and adjacencies in the complementary circulating registerThe adjacency graphs of FSRs with a class of affine characteristic functionsConstruction for de Bruijn sequences with large stageStretching de Bruijn sequencesThe cycle structure of \(\mathrm{NFSR}(f^d)\) and its applicationsA new upper bound on the order of affine sub-families of NFSRsOn a class of isomorphic NFSRsA relation between sequences generated by Golomb's preference algorithmGeneration of some de Bruijn sequencesThe decomposition of an NFSR into the cascade connection of two smaller NFSRs revisitedOn the largest affine sub-families of a family of NFSR sequencesSearching for nonlinear feedback shift registers with parallel computingAn interleaved method for constructing de Bruijn sequencesOn affine sub-families of Grain-like structuresThe adjacency graphs of some feedback shift registersConstructions of de Bruijn sequences from a full-length shift register and an irreducible LFSRSome properties of the cycle decomposition of WG-NLFSRA new result on irreducible NFSRs with respect to cascade connectionFurther results on the equivalence between Galois NFSRs and Fibonacci NFSRsA ring-like cascade connection and a class of NFSRs with the same cycle structuresOn Galois NFSRs equivalent to Fibonacci onesOn the uniqueness of a type of cascade connection representations for NFSRsOn the complexities of de-Bruijn sequencesOn affine sub-families of the NFSR in grain