, Volume 46, Issue 1, pp 57-65
Date: 10 Nov 2007

Reducing the calculation of the linear complexity of u2 v -periodic binary sequences to Games–Chan algorithm

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We show that the linear complexity of a u2 v -periodic binary sequence, u odd, can easily be calculated from the linear complexities of certain 2 v -periodic binary sequences. Since the linear complexity of a 2 v -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 u2 v -periodic binary sequence. Realizations are presented for u  =  3, 5, 7, 15.

Communicated by D. Hachenberger.