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

DOI10.1109/18.841203zbMath1013.68156OpenAlexW2167028754MaRDI QIDQ4503559

Shaoquan Jiang, Kyoki Imamura, Zongduo Dai

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

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

Related Items (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