Pages that link to "Item:Q4307342"

The following pages link to An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/ (Q4307342):

Displaying 16 items.

• Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
• Distribution of one-error linear complexity of binary sequences for arbitrary prime period (Q394411) (← links)
• On linear complexity of binary lattices. II (Q457014) (← links)
• On the \(k\)-error linear complexity of \(\ell\)-sequences (Q609360) (← links)
• Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences (Q664386) (← links)
• 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)
• Error linear complexity measures for multisequences (Q883329) (← links)
• Periodic multisequences with large error linear complexity (Q1009057) (← links)
• Remarks on a cyclotomic sequence (Q1009130) (← links)
• How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
• Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity (Q1035809) (← links)
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform (Q1599195) (← links)
• Counting functions and expected values for the \(k\)-error linear complexity (Q1609392) (← links)
• On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients (Q1620976) (← links)
• On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) (Q1721930) (← links)