• DocumentCode
    3513262
  • Title

    A New Polyphase Generalized Sequence of Length pq and Its Linear Complexity

  • Author

    Tongjiang Yan ; Pan Xu

  • Author_Institution
    Coll. of Sci., China Univ. of Pet., Qingdao, China
  • fYear
    2013
  • fDate
    9-11 Sept. 2013
  • Firstpage
    645
  • Lastpage
    648
  • Abstract
    Minimal polynomials and linear complexity of binary Ding-Hellseth generalized cyclotomic sequences of order 2 of length pq are obtained by Bai in 2005. In this correspondence, we obtain linear complexity of mu-ary Ding-Helleseth generalized cyclotomic sequences of any order. Our results show that these sequences also have high linear complexity.
  • Keywords
    computational complexity; polynomials; binary Ding-Hellseth generalized cyclotomic sequences; linear complexity; minimal polynomials; polyphase generalized sequence; Ciphers; Complexity theory; Educational institutions; Electronic mail; Petroleum; Polynomials; Zinc; linear complexity; polyphase generalized cyclotomic sequences; stream cipher;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Networking and Collaborative Systems (INCoS), 2013 5th International Conference on
  • Conference_Location
    Xi´an
  • Type

    conf

  • DOI
    10.1109/INCoS.2013.120
  • Filename
    6630505
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3513262