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

DOI10.1109/TIT.2004.842709zbMATH Open1309.94129OpenAlexW1562016879MaRDI QIDQ3547367FDOQ3547367

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

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

Mathematics Subject Classification ID

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

Cited In (20)

• 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
• On the $k$-Error Linear Complexity of $p^{m}$-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
• On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
• Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
• Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic 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
• On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• 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
• Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
• On the stability of periodic binary sequences with zone restriction
• Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
• Unbounded stability of two-term recurrence sequences modulo $2^k$
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
• Expected Value of the Linear Complexity of Two-Dimensional 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)