论文标题
确定阶2的广义二进制序列的2-辅助复杂性
Determination of 2-Adic Complexity of Generalized Binary Sequences of Order 2
论文作者
论文摘要
阶2的广义二进制序列已用于构建良好的二进制循环代码[4]。这些序列的线性复杂性已在[2]中计算出来。此类序列的自相关值已在[1]和[3]中确定。 [5]和[7]中已经介绍了此类序列的2-辅助复杂性的一些下限。在本文中，我们确定了此类序列的2-辅助复杂性的确切值。特别是，我们改善了[5]和[7]中介绍的下限，以及达到最大值的2-辅助复杂性的条件。
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in [1] and [3]. Some lower bounds of 2-adic complexity for such sequences have been presented in [5] and [7]. In this paper we determine the exact value of 2-adic complexity for such sequences. Particularly, we improve the lower bounds presented in [5] and [7] and the condition for the 2-adic complexity reaching the maximum value.
