An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
From MaRDI portal
Publication:742512
DOI10.1007/S00200-014-0222-7zbMath1381.94088OpenAlexW1995968164MaRDI QIDQ742512
Publication date: 18 September 2014
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-014-0222-7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- How many bits have to be changed to decrease the linear complexity?
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- Counting functions and expected values for the \(k\)-error linear complexity
- An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
- A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
- On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
- On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- A relationship between linear complexity and k-error linear complexity
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
- Properties of the Error Linear Complexity Spectrum
This page was built for publication: An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
