Pages that link to "Item:Q3981580"
From MaRDI portal
The following pages link to The linear complexity of binary sequences with period (2/sup n/-1)/sup k/ (Q3981580):
Displaying 14 items.
- The linear complexity of a class of binary sequences with period \(2p\) (Q499750) (← 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)
- On \((n,k)\)-sequences (Q1582080) (← links)
- Binary sequences of period \(2^m-1\) with large linear complexity (Q1854281) (← links)
- On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234) (← links)
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) (Q2311428) (← links)
- Linear Complexity of Binary Sequences Derived from Polynomial Quotients (Q2907289) (← links)
- (Q3436150) (← links)
- Linear complexity and random sequences with period \(2^ n\) (Q3983511) (← links)
- (Q3984072) (← links)
- Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period (Q4503559) (← links)
- A LINEAR COMPLEXITY ANALYSIS OF QUADRATIC RESIDUES AND PRIMITIVE ROOTS SPACINGS (Q5114772) (← links)
- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two (Q5450824) (← links)
