An algorithm for computing the error sequence of p^n-periodic binary sequences

DOI10.1007/S00200-014-0222-7MaRDI QIDQ742512zbMATH OpenOpenAlexFDO

Authors Miao Tang

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

zbMATH Keywords

\(k\)-error linear complexityalgorithmerror sequencelinear complexity

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• On the error linear complexity spectrum of \(p^n\)-periodic binary sequences
• An algorithm for the k-error linear complexity of binary sequences with period 2p^m
• An algorithm for computing the k-error linear complexity and error vector of a binary sequence with period p^n
• An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
• On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)

Cites work

• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q)
• A relationship between linear complexity and 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
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Analysis and design of stream ciphers
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
• Counting functions and expected values for the \(k\)-error linear complexity
• How many bits have to be changed to decrease the linear complexity?
• On the $k$-Error Linear Complexity of $p^{m}$-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 expected value of the linear complexity and the k-error linear complexity of periodic sequences
• On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
• Properties of the Error Linear Complexity Spectrum
• The stability theory of stream ciphers

Cited in

(8)

• On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)
• On the error linear complexity spectrum of \(p^n\)-periodic binary sequences
• m-tight error linear complexity of binary sequences with period 2p^n
• An algorithm for the k-error linear complexity of binary sequences with period 2p^m
• Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences
• Some enumeration results on binary 2ⁿ-periodic sequences
• An algorithm for computing the k-error linear complexity and error vector of a binary sequence with period p^n
• Some algorithms for the error linear complexity of binary 2ⁿ-periodic sequences

This page was built for publication: An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences

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