On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
From MaRDI portal
Publication:3547367
DOI10.1109/TIT.2004.842709zbMath1309.94129OpenAlexW1562016879MaRDI QIDQ3547367
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2004.842709
Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (13)
Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences ⋮ 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 ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ Counting Functions 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: On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
