Pages that link to "Item:Q499750"
From MaRDI portal
The following pages link to The linear complexity of a class of binary sequences with period \(2p\) (Q499750):
Displaying 12 items.
- The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation (Q894464) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- Composition of recursions and nonlinear complexity of periodic binary sequences (Q1009065) (← links)
- New binary sequences with perfect staircase profile of linear complexity (Q1210314) (← links)
- The linear complexity of a class of binary sequences with optimal autocorrelation (Q1671646) (← links)
- Some new balanced and almost balanced quaternary sequences with low autocorrelation (Q1733974) (← links)
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) (Q2311428) (← links)
- Some new classes of quaternary sequences with low autocorrelation property via two binary cyclotomic sequences (Q2700118) (← links)
- (Q3436150) (← links)
- Linear complexity for a class of balanced binary sequences of period \(p^{m+1}q^{n+1}\) (Q3462967) (← links)
- The linear complexity of binary sequences with period (2/sup n/-1)/sup k/ (Q3981580) (← links)
- (Q3984072) (← links)
