Advanced Search
Volume 33 Issue 1
Feb.  2011
Turn off MathJax
Article Contents
Zhao Lu, Wen Qiao-Yan. Stability of Joint 2-adic Complexity of Multi-periodic Sequence[J]. Journal of Electronics & Information Technology, 2011, 33(1): 185-189. doi: 10.3724/SP.J.1146.2010.00241
Citation: Zhao Lu, Wen Qiao-Yan. Stability of Joint 2-adic Complexity of Multi-periodic Sequence[J]. Journal of Electronics & Information Technology, 2011, 33(1): 185-189. doi: 10.3724/SP.J.1146.2010.00241

Stability of Joint 2-adic Complexity of Multi-periodic Sequence

doi: 10.3724/SP.J.1146.2010.00241
  • Received Date: 2010-03-15
  • Rev Recd Date: 2010-07-07
  • Publish Date: 2011-01-19
  • In this paper, the definition of joint k-error 2-adic complexity is first proposed, as well as joint k-error 2-adic complexity is used to measure the stability of 2-adic complexity of periodic multisequences. Then some enumeration results are derived for two kinds of joint error 2-adic complexity and the lower bounds are presented for their expected values of m-fold multisequences of period N, which 2N-1=p,p1p2, respectively. Furthermore, it is showed that the formula2N-1=pe(e1), has no solution. The results are important for studying the stability of joint 2-adic complexity of multisequences.
  • loading
  • Klapper A and Goresky M. Feedback shift register, 2-adic span, and combiners with Memory[J].Journal of Cryptology.1997, 10(2):111-147[2]Qi Wen-feng and Xu Hong. Partial period distrution of FCSR sequences[J].IEEE Transactions on Information Theory.2003, 49(3):761-765[3]Tian Tian and Qi Wen-feng. On FCSR memory sequences[C]. Sequences and Their Applications, Beijing, China, Sep. 2006, SETA 2006, LNCS 4086: 323-333.[4]Arnault F, Berger T P, and Minier M. Some results on FCSR automata with applications to the security of FCSR-based pseudorandom gerenators[J].IEEE Transactions on Information Theory.2008, 54(2):836-840[5]Arnault F, Berger T P, and Lauradoux C. F-FCSR stream ciphers[C]. New Stream Cipher Designs, Nov. 2008, LNCS 4986: 170-178.[6]Tian Tian and Qi Wen-feng. 2-adic complexity of binary m-sequences[J].IEEE Transactions on Information Theory.2010, 56(1):450-454[7]Hu Hong-gang and Feng Deng-guo. On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences[J].IEEE Transactions on Information Theory.2008, 54(2):874-883[8]苏明, 吴功宜. 多重周期序列联合线性复杂度及其快速算法[J]. 计算机工程, 2007, 33(9): 4-6.Su Ming and Wu Gong-yi. Joint linear complexity and its fast algorithm of multi-periodic sequence[J]. Computer Engineering, 2007, 33(9): 4-6.[9]Fu Fang-wei, Niederreiter H, and Su Ming. The expection and variance of the joint linear complexity of random periodic multisequences[J].Journal of Complexity.2005, 21(6):804-822[10]Meidl W, Niederreiter H, and Venkateswarlu A. Error linear complexity measures for multisequences[J].Journal of Complexity.2007, 23(2):169-192[11]Hu Hong-gang and Feng Deng-guo. On the expected value of the joint 2-adic complexity of periodic binary multisequences[C]. Sequences and Their Applications, Beijing, China, Sep. 2006, SETA 2006, LNCS 4086: 199-208.[12]董丽华, 胡予濮, 曾勇. 多重周期二元序列的联合k-错2-adic复杂度[J]. 计算机学报, 2009, 32(6): 1134-1139.Dong Li-hua, Hu Yu-pu, and Zeng Yong. Joint k-error 2-adic complexity for binary periodic multi-sequeces[J].Chinese Journal of Computers.2009, 32(6):1134-1139[13]王磊, 蔡勉, 肖国镇. 周期序列2-adic复杂度的稳定性[J]. 西安电子科技大学学报, 2000, 27(3): 348-350.Wang Lei, Cai Mian, and Xiao Guo-zhen. On stability of 2-adic complexity of periodic sequence[J]. Journal of Xidian University, 2000, 27(3): 348-350.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3556) PDF downloads(806) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return