The following pages link to (Q3154866):
Displaying 15 items.
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- On the \(k\)-error linear complexity of \(\ell\)-sequences (Q609360) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences (Q1032491) (← links)
- Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity (Q1422205) (← links)
- An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime (Q1854286) (← links)
- Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences (Q2383994) (← links)
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) (Q2430407) (← links)
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 (Q3400065) (← links)
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences (Q3443217) (← links)
- (Q4421635) (← links)
- Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators (Q4488472) (← links)
- Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period (Q4503559) (← links)
- On the k-Operation Linear Complexity of Periodic Sequences (Q5458219) (← links)
- (Q5708929) (← links)