| 摘要: |
| 对称2-adic复杂度是周期二元序列抵抗有理逼近算法攻击的一个重要的指标. 分析并确定了一类周期为4N(N = 3 (mod 4) )具有级联交织结构的二元序列的对称2-adic复杂度, 结果表明在一定条件下该序列的对称2-adic复杂度不小于周期的一半. |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目: |
|
|
|
zhengkunbin,kepinhui
|
| Abstract: |
| Symmetric 2-adic complexity serves as an important indicator for periodic binary sequences to resist rational approximation attacks. In this paper, the symmetric 2-adic complexity of a class of interleaving cascade binary sequences with 4N(N = 3 (mod 4)) is determined. Our results indicate that the symmetric 2-adic complexity of the discussed sequence is not less than the half of its period under certain conditions. |
| Key words: |
