由二元周期序列添加或删除一个比特所得序列的线性复杂度

The Linear Complexity of the Period Sequences Obtainedfrom the Binary Sequeces by One-Symbol Delete or Insert

文章研究了由二元周期序列添加或删除一个比特后所得序列线性复杂度的上界和下界。

In this paper,we will get the lower bound and the upper bound of the linear complexity of period sequences obtained from a binary period sequence by one symbol delete or one symbol insert.