Composition of recursions and nonlinear complexity of periodic binary sequences
Designs, Codes and Cryptography
Determining the complexity of FH/SS sequence by approximate entropy
IEEE Transactions on Communications
Remarks on the new attack on the filter generator and the role of high order complexity
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Synthesis of parallel binary machines
Proceedings of the International Conference on Computer-Aided Design
Nonlinear complexity of binary sequences and connections with lempel-ziv compression
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
| Hi-index | 754.84 |
The problem of finding the length of a shortest feedback shift register that generates a given finite-length sequence is considered. An efficient algorithm for the determination of the span is proposed, that takes advantage of the special block structure of the associated system of linear equations. The span distribution of finite-length binary sequences is also studied.