On the k-Error Linear Complexity of p^{m}-Periodic Binary Sequences
From MaRDI portal
Publication:3548835
DOI10.1109/TIT.2007.896863zbMATH Open1323.94094MaRDI QIDQ3548835FDOQ3548835
Author name not available (Why is that?)
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
- \(m\)-tight error linear complexity of binary sequences with period \(2p^n\)
- Analysis of the linear complexity and its stability for periodic binary sequences
- \(k\)-error linear complexity distribution of \(2^n\)-periodic binary sequences with linear complexity \(2^n-9\)
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
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
- On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
- Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
- Periodic multisequences with large error linear complexity
- Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
- Analysis of the linear complexity and its stability for periodic binary sequences
- On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
- On the k-Operation Linear Complexity of Periodic Sequences
- Title not available (Why is that?)
- Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
- Lower bounds on error complexity measures for periodic LFSR and FCSR 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
- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two
This page was built for publication: On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548835)