Pages that link to "Item:Q1008964"
From MaRDI portal
The following pages link to Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964):
Displaying 6 items.
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
- On evaluating the linear complexity of a sequence of least period \(2^ n\) (Q1329115) (← links)
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. (Q1401213) (← links)
- Quadratic functions with prescribed spectra (Q1934217) (← links)
- On the stability of periodic binary sequences with zone restriction (Q2081551) (← links)
- Computing the linear complexity for sequences with characteristic polynomial \(f^v\) (Q2392687) (← links)