An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/

DOI10.1109/18.243455MaRDI QIDQ4307342zbMATH OpenOpenAlexFDO

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

algorithm linear complexity pseudo-random sequences

Random number generation in numerical analysis (65C10) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

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)$

Cited in

(66)

Some enumeration results on binary $2^n$-periodic sequences
Distribution of one-error linear complexity of binary sequences for arbitrary prime period
Analysis and computation of multidimensional linear complexity of periodic arrays
On a secure binary sequence generated by a quadratic polynomial on $\mathbb{Z}_{2^n}$
On error linear complexity of new generalized cyclotomic binary sequences of period $p^2$
On the stability of $m$-sequences
Linear Complexity and Random Sequences
Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
An algorithm fork-error joint linear complexity of binary multisequences
Computation of the $k$-error linear complexity of binary sequences with period $2^n$
Evaluating the randomness of chaotic binary sequences via a novel period detection algorithm
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)$
Characterization of the third descent points 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 $\mathbb{F}_d$
Linear complexity, $k$-error linear complexity, and the discrete Fourier transform
A construction ofp-ary balanced sequence with largek-error linear complexity
Confirmatory tests used in cipher systems evaluations
Fast algorithms for determining the linear complexities of sequences over $GF(p^{m})$ with the period $3 n$
A simple stream cipher with proven properties
Determining the k-error joint linear complexity spectrum for a binary multisequence with period p^n
Reducing the calculation of the linear complexity of $u_2^v$-periodic binary sequences to Games-Chan algorithm
An algorithm for the spectral immunity of binary sequence with period $2^n$
On the k-error linear complexity of binary sequences derived from polynomial quotients
On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences
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
Remarks on the $k$-error linear complexity of $p^n$-periodic sequences
An efficient algorithm to generate binary sequences for cryptographic purposes
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
Periodic multisequences with large error linear complexity
Remarks on a cyclotomic sequence
𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients
Sequences with controllable linear complexity profile
scientific article; zbMATH DE number 820492 (Why is no real title available?)
Some algorithms for the error linear complexity of binary 2ⁿ-periodic sequences
On $k$-error linear complexity of some explicit nonlinear pseudorandom sequences
An algorithm for computing all the critical points of exponent periodic sequences
How to determine linear complexity and $k$-error linear complexity in some classes of linear recurring sequences
On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory
On the linear complexity for multidimensional sequences
On the $k$-error linear complexities of De Bruijn sequences
Properties of error linear complexity of binary sequences
An algorithm for the $k$-error linear complexity of binary sequences with period $2p^m$
On the $k$-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
On the $k$-error linear complexity of sequences from function fields
An algorithm for the $k$-error linear complexity of sequences over GF$(p^m)$ with period $p^n$, $ p$ a prime
Linear complexity of generalized sequences by comparison of PN-sequences
Remarks on the generalized cyclotomic sequences of length $2p^m$
scientific article; zbMATH DE number 67090 (Why is no real title available?)
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
The $k$-error linear complexity distribution for $2^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
Asymptotic analysis on the normalized k-error linear complexity of binary 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)