...
首页> 外文期刊>Information Theory, IEEE Transactions on >The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
【24h】

The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$

机译:周期为$ p ^ {m + 1} q ^ {n + 1} $的Whiteman广义环原子序列的线性复杂度

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we mainly get three results. First, let $p$, $q$ be distinct primes with $gcd ((p-1)p,(q-1)q)=gcd (p-1,q-1)=e$ ; we give a method to compute the linear complexity of Whiteman's generalized cyclotomic sequences of period $p^{m+1}q^{n+1}$. Second, if $e=4$, we compute the exact linear complexity of Whiteman's generalized cyclotomic sequences. Third, if $p equiv q equiv 5~({rm mod}~8)$, $gcd (p-1, q-1)=4$, and we fix a common primitive root $g$ of both $p$ and $q$, then $2in H_{0}=(g)$, which is a subgroup of the multiplicative group $Z_{pq}^{ast}$, if and only if Whiteman's generalized cyclotomic numbers of order 4 depend on the decomposition $pq=a^{2}+4b^{2}$ with $4vert b$.
机译:在本文中,我们主要得到三个结果。首先,用$ gcd((p-1)p,(q-1)q)= gcd(p-1,q-1)= e $来让$ p $,$ q $是不同的素数;我们给出了一种计算周期为$ p ^ {m + 1} q ^ {n + 1} $的Whiteman广义环原子序列的线性复杂度的方法。其次,如果$ e = 4 $,我们将计算Whiteman广义环原子序列的精确线性复杂度。第三,如果$ p equiv q equiv 5〜({rm mod}〜8)$,则$ gcd(p-1,q-1)= 4 $,我们固定了两个$ p $的公共原始根$ g $和$ q $,则H_ {0} =(g)$中的$ 2,它是乘法组$ Z_ {pq} ^ {ast} $的子组,当且仅当Whiteman的4阶广义环数依赖于用$ 4vert b $分解$ pq = a ^ {2} + 4b ^ {2} $。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号