Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
Shaoquan Jiang, Zongduo Dai, Kyoki Imamura · IEEE Transactions on Information Theory · 2000
A unified derivation of the bounds of the linear complexity is given for a sequence obtained from a periodic sequence over GF(q) by either substituting, inserting, or deleting k symbols within one period. The lower bounds are useful in case of n