scientific article; zbMATH DE number 25605

zbMATH Open0764.11051MaRDI QIDQ3984072FDOQ3984072

Authors: Chaoping Xing, Guozhen Xiao, Keqin Feng 

Publication date: 27 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of a periodic sequence over GF(p)
• On the calculation of the linear complexity of periodic sequences
• Linear complexity of periodic sequences: a general theory
• Complexité de suites engendrées par des récurrences unipotentes
• On evaluating the linear complexity of a sequence of least period \(2^ n\)
• Kolmogorov complexity of the initial segments of almost periodic sequences
• The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields
• The linear complexity of a class of binary sequences with period \(2p\)
• scientific article; zbMATH DE number 26870
• The linear complexity of binary sequences with period (2/sup n/-1)/sup k/

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

This page was built for publication:

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