On the Stability of<tex>2ⁿ</tex>-Periodic Binary Sequences

DOI10.1109/TIT.2004.842709MaRDI QIDQ3547367zbMATH OpenOpenAlexFDO

Authors Wilfried Meidl

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity

Cited in

(20)

• 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
• 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
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
• On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
• Characterization of the third descent points for the k-error linear complexity of 2ⁿ-periodic binary sequences
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
• Distribution of one-error linear complexity of binary sequences for arbitrary prime period
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Unbounded stability of two-term recurrence sequences modulo 2ᵏ
• Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
• How many bits have to be changed to decrease the linear complexity?
• An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences

This page was built for publication: On the Stability of&lt;tex&gt;$2^n$&lt;/tex&gt;-Periodic Binary Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547367)