On the largest affine sub-families of a family of NFSR sequences
From MaRDI portal
Publication:2439751
DOI10.1007/s10623-012-9723-1zbMath1323.94096OpenAlexW2090600233MaRDI QIDQ2439751
Publication date: 17 March 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9723-1
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
A new upper bound on the order of affine sub-families of NFSRs, On a class of isomorphic NFSRs, On affine sub-families of Grain-like structures, The adjacency graphs of some feedback shift registers, A new linearization method for nonlinear feedback shift registers, Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs, On affine sub-families of the NFSR in grain
Uses Software
Cites Work