## Reducing the calculation of the linear complexity of binary u2^v-periodic sequences to Games-Chan algorithm
Meidl, Wilfried (2008)
Official URL: http://dx.doi.org/10.1007/s10623-007-9134-x ## AbstractWe 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$.
## Available Versions of this Item- Reducing the calculation of the linear complexity of binary u2^v-periodic sequences to Games-Chan algorithm. (deposited 16 Nov 2007 11:49)
- Reducing the calculation of the linear complexity of binary u2^v-periodic sequences to Games-Chan algorithm. (deposited 08 Jun 2008 18:46)
**[Currently Displayed]**
- Reducing the calculation of the linear complexity of binary u2^v-periodic sequences to Games-Chan algorithm. (deposited 08 Jun 2008 18:46)
Repository Staff Only: item control page |