Pages that link to "Item:Q1329115"
From MaRDI portal
The following pages link to On evaluating the linear complexity of a sequence of least period \(2^ n\) (Q1329115):
Displaying 5 items.
- Sequences with good correlation property based on depth and interleaving techniques (Q499671) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. (Q1401213) (← links)
- Linear Complexity of Periodic Sequences: A General Theory (Q3452366) (← links)
- (Q3984072) (← links)