Pages that link to "Item:Q1854286"
From MaRDI portal
The following pages link to An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime (Q1854286):
Displaying 14 items.
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512) (← links)
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) (Q862718) (← links)
- On the stability of periodic binary sequences with zone restriction (Q2081551) (← links)
- Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences (Q2383994) (← links)
- Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences (Q2408276) (← links)
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) (Q2430407) (← links)
- On the error linear complexity spectrum of \(p^n\)-periodic binary sequences (Q2441445) (← links)
- An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences (Q2860223) (← links)
- On the Stability of m-Sequences (Q3104700) (← links)
- A construction of<i>p</i>-ary balanced sequence with large<i>k-</i>error linear complexity (Q3410901) (← links)
- An algorithm for<i>k</i>-error joint linear complexity of binary multisequences (Q3542554) (← links)
- (Q4421635) (← links)
- An algorithm for computing all the critical points of exponent periodic sequences (Q5382106) (← links)
- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences (Q5447518) (← links)