A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)

DOI10.1109/TIT.1983.1056619zbMath0498.68034OpenAlexW2018168377MaRDI QIDQ3964019

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1983.1056619

zbMATH Keywords

linear feedback shift register

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Number-theoretic algorithms; complexity (11Y16)

Related Items (40)

Spectra of a class of quadratic functions: average behaviour and counting functions ⋮ On evaluating the linear complexity of a sequence of least period $2^ n$ ⋮ Roulette games and depths of words over finite commutative rings ⋮ Determining the $k$-error joint linear complexity spectrum for a binary multisequence with period $p^n$ ⋮ Perfect factors in the de Bruijn graph ⋮ Linear Complexity of Periodic Sequences: A General Theory ⋮ Further results on correlation functions of de Bruijn sequences ⋮ Remarks on the $k$-error linear complexity of $p^n$-periodic sequences ⋮ Computing the linear complexity for sequences with characteristic polynomial $f^v$ ⋮ Fast algorithms for determining the linear complexities of sequences over $GF(p^{m})$ with the period $3 n$ ⋮ New application methods for word-oriented cryptographic primitives ⋮ 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 ⋮ Distribution of one-error linear complexity of binary sequences for arbitrary prime period ⋮ Quadratic functions with prescribed spectra ⋮ Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. ⋮ On the error linear complexity spectrum of $p^n$-periodic binary sequences ⋮ On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks ⋮ An algorithm fork-error joint linear complexity of binary multisequences ⋮ Some algorithms for the error linear complexity of binary 2 n -periodic sequences ⋮ Sequences with good correlation property based on depth and interleaving techniques ⋮ On the depth spectrum of binary linear codes and their dual ⋮ Rotating-table games and derivatives of words ⋮ 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 some classes of nonlinear shift registers with the same cyclic structure ⋮ 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 ⋮ Reducing the calculation of the linear complexity of $u_2^v$-periodic binary sequences to Games-Chan algorithm ⋮ An algorithm for computing the error sequence of $p^{n}$-periodic binary sequences ⋮ Some Enumeration Results on Binary 2ⁿ-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 ⋮ How to determine linear complexity and $k$-error linear complexity in some classes of linear recurring 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 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 ⋮ On the distribution of de Bruijn sequences of low complexity

This page was built for publication: A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)