Information Security and Cryptology

DOI10.1007/11599548MaRDI QIDQ5897816zbMATH OpenOpenAlexFDO

Authors Shimin Wei, Guolong Chen, Guozhen Xiao

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11599548

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• A fast algorithm for determining the linear complexity in periodic sequences
• scientific article; zbMATH DE number 1955778
• A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
• A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q)
• A fast algorithm for determining the linear complexity of a binary sequence with period 2ⁿp^m

Cited in

(17)

• How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
• Studies on the distribution of the shortest linear recurring sequences
• A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q)
• A fast algorithm for the 2-adic joint complexity of p^n-periodic binary multisequence
• On the calculation of the linear complexity of periodic sequences
• Linear complexity of periodic sequences: a general theory
• Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$
• scientific article; zbMATH DE number 1955778 (Why is no real title available?)
• Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
• Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences
• A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)
• A fast algorithm for determining the minimal polynomial of \(up^n\)-periodic sequence
• scientific article; zbMATH DE number 7089069 (Why is no real title available?)
• A fast algorithm for determining the linear complexity in periodic sequences
• A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
• A fast algorithm for determining the linear complexity of a binary sequence with period 2ⁿp^m
• Revisiting the relationship between compositional sequence complexity and periodicity

This page was built for publication: Information Security and Cryptology

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