A new upper bound on the order of affine sub-families of NFSRs
From MaRDI portal
Publication:2179656
DOI10.1007/s11424-019-8072-9zbMath1456.94037OpenAlexW2997460180WikidataQ126460074 ScholiaQ126460074MaRDI QIDQ2179656
Qun-Xiong Zheng, Jun-Ying Liu, Dong-Dai Lin
Publication date: 13 May 2020
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-019-8072-9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A surprisingly simple de Bruijn sequence construction
- On affine sub-families of Grain-like structures
- There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
- Construction of de Bruijn sequences from product of two irreducible polynomials
- On the complexities of de-Bruijn sequences
- On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR
- On affine sub-families of the NFSR in grain
- Quark: a lightweight hash
- Construction for de Bruijn sequences with large stage
- Stretching de Bruijn sequences
- On the largest affine sub-families of a family of NFSR sequences
- Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
- Further Results on the Decomposition of an NFSR Into the Cascade Connection of an NFSR Into an LFSR
- On the Density of Irreducible NFSRs
- Trivium
- On the cycle structure of some nonlinear shift register sequences
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
This page was built for publication: A new upper bound on the order of affine sub-families of NFSRs
