2-Adic Complexity of Self-Shrinking Sequence

この論文にアクセスする

この論文をさがす

著者

    • WANG Huijuan
    • State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications
    • WEN Qiaoyan
    • State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications
    • ZHANG Jie
    • School of Science, Beijing University of Posts and Telecommunications

抄録

This paper studies the 2-adic complexity of the self-shrinking sequence under the relationship between 2-adic integers and binary sequences. Based on the linear complexity and the number of the sequences which have the same connection integer, we conclude that the 2-adic complexity of the self-shrinking sequence constructed by a binary m-sequence of order n has a lower bound 2<sup><i>n</i>-2</sup>-1. Furthermore, it is shown that its 2-adic complexity has a bigger lower bound under some circumstances.

収録刊行物

  • IEICE transactions on fundamentals of electronics, communications and computer sciences

    IEICE transactions on fundamentals of electronics, communications and computer sciences 94(11), 2462-2465, 2011-11-01

    一般社団法人 電子情報通信学会

参考文献:  7件中 1-7件 を表示

各種コード

  • NII論文ID(NAID)
    10030192305
  • NII書誌ID(NCID)
    AA10826239
  • 本文言語コード
    ENG
  • 資料種別
    SHO
  • ISSN
    09168508
  • データ提供元
    CJP書誌  J-STAGE 
ページトップへ