Pages that link to "Item:Q865964"
From MaRDI portal
The following pages link to A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\) (Q865964):
Displaying 6 items.
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- An efficient algorithm for software generation of binary linear recurrences (Q1762549) (← links)
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) (Q2311428) (← links)
- Fast DHT algorithms for length \(N=q*2^m\) (Q2732815) (← links)
- A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence (Q2860219) (← links)
- (Q4857241) (← links)
