通信学报
• 学术论文 • 上一篇 下一篇
游伟1,戚文峰2,3
出版日期:
发布日期:
基金资助:
Online:
Published:
摘要: 研究了由 上单圈T-函数所导出权位序列的2-adic复杂度,设 为整数, 。结论表明,第 权位序列2-adic复杂度的上界为 。另外,讨论了与所有单圈 T-函数所导出第 权位序列相对应的2-adic整数的分布,分布情况说明这个上界是可以达到的。最后,研究了权位序列的1-错2-adic复杂度。研究结果表明对所有 ,权位序列 的1-错2-adic 复杂度都与其2-adic复杂度相同。
Abstract: The 2-adic complexities of the coordinate sequences derived from single cycle T-functions over were investigated. Let be an integer such that . It is shown that the 2-adic complexity of the th coordinate sequence is upper bounded by . The distribution of the corresponding 2-adic number associated with the th coordinate sequence of all single cycle T-functions was also discussed, which implies that the upper bound is attainable. Moreover, 1-error 2-adic complexity was also studied. It was proved that the 1-error 2-adic complexity of the th coordinate sequence is equal to its 2-adic complexity except for .
游伟1,戚文峰2,3. 单圈T-函数的2-adic复杂度和1-错2-adic复杂度[J]. 通信学报.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.infocomm-journal.com/txxb/CN/
https://www.infocomm-journal.com/txxb/CN/Y2014/V35/I3/15