Pages that link to "Item:Q3964019"
From MaRDI portal
The following pages link to A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.) (Q3964019):
Displayed 40 items.
- Spectra of a class of quadratic functions: average behaviour and counting functions (Q269563) (← links)
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- New application methods for word-oriented cryptographic primitives (Q362307) (← links)
- Distribution of one-error linear complexity of binary sequences for arbitrary prime period (Q394411) (← links)
- Sequences with good correlation property based on depth and interleaving techniques (Q499671) (← links)
- On the depth spectrum of binary linear codes and their dual (Q507476) (← links)
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512) (← links)
- Roulette games and depths of words over finite commutative rings (Q831155) (← links)
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) (Q862718) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← 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)
- On the distribution of de Bruijn sequences of low complexity (Q1069308) (← links)
- Further results on correlation functions of de Bruijn sequences (Q1101063) (← links)
- Rotating-table games and derivatives of words (Q1208719) (← links)
- On evaluating the linear complexity of a sequence of least period \(2^ n\) (Q1329115) (← links)
- Perfect factors in the de Bruijn graph (Q1345135) (← links)
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. (Q1401213) (← links)
- An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime (Q1854286) (← links)
- Quadratic functions with prescribed spectra (Q1934217) (← links)
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks (Q1960219) (← 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)
- Computing the linear complexity for sequences with characteristic polynomial \(f^v\) (Q2392687) (← 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 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)
- On some classes of nonlinear shift registers with the same cyclic structure (Q3064476) (← links)
- A construction of<i>p</i>-ary balanced sequence with large<i>k-</i>error linear complexity (Q3410901) (← links)
- Linear Complexity of Periodic Sequences: A General Theory (Q3452366) (← 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<sup>n</sup>-Periodic Sequences (Q4977893) (← 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)
