Lower and Upper Bounds on the Density of Irreducible NFSRs
Yupeng Jiang, Dongdai Lin · IEEE Transactions on Information Theory · 2018
A nonlinear feedback shift register (NFSR) of n-stage is called irreducible if, the family of output sequences of any NFSR of stage less than $n$ is not included in that of the NFSR. Tian and Qi in this paper [IEEE-IT, 2013(6),4006-4012] gave a lower bound on the density of irreducible NFSRs. In this paper, we improve their lower bound and also give an upper bound on the density of irreducible NFSRs. Moreover, the gap between our upper and lower bounds is less than 0.04.