A note on the crosscorrelation of maximal length FCSR sequences
Designs, Codes and Cryptography
Linearity properties of binary FCSR sequences
Designs, Codes and Cryptography
On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
On the distinctness of decimations of generalized l-sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the distinctness of maximal length sequences over Z/(pq) modulo 2
Finite Fields and Their Applications
On the k-error linear complexity of l-sequences
Finite Fields and Their Applications
Periods of termwise exclusive ors of maximal length FCSR sequences
Finite Fields and Their Applications
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
Information Processing Letters
| Hi-index | 754.84 |
Klapper and Goresky (1995) introduced feedback with carry shift register (FCSR) and presented a significant kind of FCSR sequences, that is, l-sequences. They showed that the number of 0s and 1s occurring in one of their periods are equal. We discuss the partial period distribution of l-sequences, and show that when the periods become large, the proportion of 1s (resp., 0s) occurring in any of their partial periods approximates 50%.