An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
From MaRDI portal
Publication:4307342
DOI10.1109/18.243455zbMATH Open0801.94009OpenAlexW2126085961MaRDI QIDQ4307342FDOQ4307342
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.243455
Recommendations
- An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
- A relationship between linear complexity and k-error linear complexity
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)
Random number generation in numerical analysis (65C10) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cited In (60)
- Computation of the \(k\)-error linear complexity of binary sequences with period \(2^n\)
- On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences
- Title not available (Why is that?)
- Distribution of one-error linear complexity of binary sequences for arbitrary prime period
- Linear Complexity and Random Sequences
- On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
- An algorithm fork-error joint linear complexity of binary multisequences
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
- Counting functions and expected values for the \(k\)-error linear complexity
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)
- A construction ofp-ary balanced sequence with largek-error linear complexity
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Some algorithms for the error linear complexity of binary 2 n -periodic sequences
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\)
- ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS
- A simple stream cipher with proven properties
- On the Stability of m-Sequences
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\)
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
- Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
- On the \(k\)-error linear complexity of \(\ell\)-sequences
- An efficient algorithm to generate binary sequences for cryptographic purposes
- Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences
- Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences
- On linear complexity of binary lattices. II
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
- Error linear complexity measures for multisequences
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
- Periodic multisequences with large error linear complexity
- Remarks on a cyclotomic sequence
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- Sequences with controllable linear complexity profile
- Some Enumeration Results on Binary 2n-Periodic Sequences
- On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
- An algorithm for the spectral immunity of binary sequence with period 2 n
- On the linear complexity for multidimensional sequences
- On the \(k\)-error linear complexities of De Bruijn sequences
- Evaluating the Randomness of Chaotic Binary Sequences Via a Novel Period Detection Algorithm
- An algorithm for the \(k\)-error linear complexity of binary sequences with period \(2p^m\)
- 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
- Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
- An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
- Title not available (Why is that?)
- Remarks on the generalized cyclotomic sequences of length \(2p^m\)
- On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d
- Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
- Additive character sums of polynomial quotients
- On the stability of periodic binary sequences with zone restriction
- Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
- On the error linear complexity spectrum of \(p^n\)-periodic binary sequences
- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences
- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two
- The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
- Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences
- On k-error linear complexity of some explicit nonlinear pseudorandom sequences
- On evaluating the linear complexity of a sequence of least period \(2^ n\)
This page was built for publication: An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307342)
