Pages that link to "Item:Q2430407"

The following pages link to On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) (Q2430407):

Displaying 13 items.

• An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512) (← links)
• How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
• An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime (Q1854286) (← 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)
• Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences (Q2411159) (← links)
• On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory (Q2668568) (← links)
• An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences (Q2860223) (← links)
• \(m\)-tight error linear complexity of binary sequences with period \(2p^n\) (Q2916331) (← links)
• Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences (Q3443217) (← links)
• (Q4421635) (← links)
• An algorithm for computing all the critical points of exponent periodic sequences (Q5382106) (← links)