An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
From MaRDI portal
Publication:4307342
DOI10.1109/18.243455zbMath0801.94009OpenAlexW2126085961MaRDI QIDQ4307342
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
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Random number generation in numerical analysis (65C10)
Related Items (48)
On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients ⋮ Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) ⋮ Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences ⋮ Evaluating the Randomness of Chaotic Binary Sequences Via a Novel Period Detection Algorithm ⋮ Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) ⋮ Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences ⋮ Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ On the \(k\)-error linear complexity of \(\ell\)-sequences ⋮ Error linear complexity measures for multisequences ⋮ Remarks on the generalized cyclotomic sequences of length \(2p^m\) ⋮ Distribution of one-error linear complexity of binary sequences for arbitrary prime period ⋮ On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) ⋮ A simple stream cipher with proven properties ⋮ ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ On the error linear complexity spectrum of \(p^n\)-periodic binary sequences ⋮ On linear complexity of binary lattices. II ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ An algorithm fork-error joint linear complexity of binary multisequences ⋮ Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences ⋮ Some algorithms for the error linear complexity of binary 2 n -periodic sequences ⋮ 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3 ⋮ Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences ⋮ On the linear complexity for multidimensional sequences ⋮ The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences ⋮ Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences ⋮ Periodic multisequences with large error linear complexity ⋮ Remarks on a cyclotomic sequence ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Some Enumeration Results on Binary 2n-Periodic Sequences ⋮ An algorithm for the spectral immunity of binary sequence with period 2 n ⋮ Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences ⋮ On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d ⋮ 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ On the Stability of m-Sequences ⋮ Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity ⋮ A construction ofp-ary balanced sequence with largek-error linear complexity ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ On the stability of periodic binary sequences with zone restriction ⋮ An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime ⋮ Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform ⋮ Additive character sums of polynomial quotients ⋮ Counting functions and expected values for the \(k\)-error linear complexity
This page was built for publication: An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
