两个符号替换下F_q上周期序列线性复杂度的计算

Linear Complexities of Sequences Obtained from Periodic Sequences over F_q by Two-Symbol Substitution

给出了两个符号替换下Fq上周期序列线性复杂度的计算方法和代数表达式 ,并确定了m

An expression of the linear complexity of a periodic sequence under andy 2 symbol substitution and a tight lower bound of the linear complexity of an m sequence under the 2 symbol substitutions are given.\;