Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period

DOI10.1109/18.841203MaRDI QIDQ4503559zbMATH OpenOpenAlexFDO

Authors Shaoquan Jiang, Zongduo Dai, Kyoki Imamura

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.841203

zbMATH Keywords

linear complexityperiodic sequences over \(k\)-symbol substitution

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Combinatorics on words (68R15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Linear complexity for one-symbol substitution of a periodic sequence over GF(q)
• Linear complexity of periodic sequences: a general theory
• On the calculation of the linear complexity of periodic sequences
• On the k-Operation Linear Complexity of Periodic Sequences
• scientific article; zbMATH DE number 2127875
• A fast algorithm for determining the linear complexity in periodic sequences
• Information Security and Cryptology
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Cryptography and Coding
• The linear complexity of binary sequences with period (2/sup n/-1)/sup k/

Cited in

(1)

• Lower bounds on error complexity measures for periodic LFSR and FCSR sequences

This page was built for publication: Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period

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