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 48 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)
• On the linear complexity for multidimensional sequences (Q1791680) (← 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 generalized cyclotomic sequences of length \(2p^m\) (Q1928788) (← links)
• A simple stream cipher with proven properties (Q1947647) (← links)
• On the \(k\)-error linear complexities of De Bruijn sequences (Q2057161) (← links)
• On the stability of periodic binary sequences with zone restriction (Q2081551) (← links)
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields (Q2325205) (← 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 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)
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences (Q2510654) (← links)
• On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory (Q2668568) (← links)
• Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences (Q2801767) (← links)
• An algorithm for the spectral immunity of binary sequence with period 2 n (Q2825267) (← links)
• Additive character sums of polynomial quotients (Q2869127) (← links)
• On the Stability of m-Sequences (Q3104700) (← links)
• 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 (Q3400065) (← links)
• On k-error linear complexity of some explicit nonlinear pseudorandom sequences (Q3403211) (← links)
• A construction of<i>p</i>-ary balanced sequence with large<i>k-</i>error linear complexity (Q3410901) (← links)
• Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences (Q3443217) (← links)
• An algorithm for<i>k</i>-error joint linear complexity of binary multisequences (Q3542554) (← links)
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3 (Q3600446) (← links)
• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences (Q3644198) (← links)
• Some Enumeration Results on Binary 2ⁿ-Periodic Sequences (Q4977893) (← links)
• On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d (Q4983539) (← links)
• On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← links)
• Evaluating the Randomness of Chaotic Binary Sequences Via a Novel Period Detection Algorithm (Q5072448) (← links)
• ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS (Q5118597) (← links)
• Some algorithms for the error linear complexity of binary 2 n -periodic sequences (Q5400126) (← links)
• Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences (Q5447518) (← links)