Back to Search
Start Over
Lower and Upper Bounds on the Density of Irreducible NFSRs.
- Source :
-
IEEE Transactions on Information Theory . May2018, Vol. 64 Issue 5, p3944-3952. 9p. - Publication Year :
- 2018
-
Abstract
- 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. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 64
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 129266218
- Full Text :
- https://doi.org/10.1109/TIT.2018.2796127