Pages that link to "Item:Q2383994"
From MaRDI portal
The following pages link to Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences (Q2383994):
Displaying 13 items.
- Distribution of one-error linear complexity of binary sequences for arbitrary prime period (Q394411) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences (Q1032491) (← links)
- Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity (Q1035809) (← links)
- Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity (Q1422205) (← links)
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform (Q1599195) (← links)
- An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime (Q1854286) (← links)
- (Q3154866) (← 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)
- Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences (Q3644198) (← links)
- (Q4421635) (← links)
- On the k-Operation Linear Complexity of Periodic Sequences (Q5458219) (← links)
