Back to Search
Start Over
Investigations on Periodic Sequences With Maximum Nonlinear Complexity.
- Source :
-
IEEE Transactions on Information Theory . Oct2017, Vol. 63 Issue 10, p6188-6198. 11p. - Publication Year :
- 2017
-
Abstract
- The nonlinear complexity of a periodic sequence s is the length of the shortest feedback shift register that can generate s, and its value is upper bounded by the least period of s minus 1. In this paper, a recursive approach that generates all periodic sequences with maximum nonlinear complexity is presented, and the total number of such sequences is determined. The randomness properties of these sequences are also examined. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 63
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 125207032
- Full Text :
- https://doi.org/10.1109/TIT.2017.2714681