Results on the Nonlinear Span of Binary Sequences
Panagiotis Rizomiliotis, N. Kalouptsidis · IEEE Transactions on Information Theory · 2005
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.