Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games–Chan algorithm
- First Online:
- Cite this article as:
- Meidl, W. Des. Codes Cryptogr. (2008) 46: 57. doi:10.1007/s10623-007-9134-x
We show that the linear complexity of a u2v-periodic binary sequence, u odd, can easily be calculated from the linear complexities of certain 2v-periodic binary sequences. Since the linear complexity of a 2v-periodic binary sequence can efficiently be calculated with the Games-Chan algorithm, this leads to attractive procedures for the determination of the linear complexity of a u2v-periodic binary sequence. Realizations are presented for u = 3, 5, 7, 15.