二阶广义二元序列2-Adic复杂度的确定
Determination of 2-Adic Complexity of Generalized Binary Sequences of Order 2
摘要：
二阶广义二元序列已被用来构造好的二元循环码[4]。这些序列的线性复杂度已在[2]中计算过。这种序列的自相关值已在[1]和[3]中确定。在[5]和[7]中已经给出了这类序列的2-adic复杂度的一些下界。在本文中，我们确定的2-adic复杂度的确切值，这样的序列。特别地，我们改进了[5]和[7]中给出的下界和2-adic复杂度达到最大值的条件。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
