On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
From MaRDI portal
Publication:3548835
DOI10.1109/TIT.2007.896863zbMath1323.94094MaRDI QIDQ3548835
No author found.
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (6)
Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(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 ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ Lower bounds on error complexity measures for periodic LFSR and FCSR sequences ⋮ On the stability of periodic binary sequences with zone restriction
This page was built for publication: On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
