A fast algorithm for determining the complexity of a binary sequence with period2^n(Corresp.)
- 1 January 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (1) , 144-146
- https://doi.org/10.1109/tit.1983.1056619
Abstract
The complexity of a periodic sequence(s)is defined to be the least number of stages in a linear feedback shift register that generates(s).Keywords
This publication has 3 references indexed in Scilit:
- An analysis of the structure and complexity of nonlinear binary sequence generatorsIEEE Transactions on Information Theory, 1976
- Generation of binary sequences with controllable complexityIEEE Transactions on Information Theory, 1971
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969