The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity

DOI10.1007/11863854_8zbMath1152.94381OpenAlexW2120103429MaRDI QIDQ3541911

Fang-Wei Fu, Harald Niederreiter, Ming Su

Publication date: 27 November 2008

Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11863854_8

zbMATH Keywords

fast algorithmscounting functionlinear complexityperiodic sequences\(k\)-error linear complexitystream cipher systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Number-theoretic algorithms; complexity (11Y16)

Related Items (10)

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 ⋮ 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3 ⋮ 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 ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity ⋮ On the stability of periodic binary sequences with zone restriction

This page was built for publication: The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity