• DocumentCode
    3781887
  • Title

    Research on Excellent Sequence of Period p^n over GF(q) with Genetic Algorithm

  • Author

    Zhihua Niu;Ling Ye;Qinqin Li

  • Author_Institution
    Sch. of Comput. Eng. &
  • fYear
    2015
  • Firstpage
    1769
  • Lastpage
    1773
  • Abstract
    The pn-periodic q-ary sequence with high linear complexity and high k-error linear complexity is defined as excellent sequence. With appropriate fitness function and parameters, this paper design a genetic algorithm to generate the N-periodic q-ary excellent sequences, where N=27, 81, , 2187, and get some laws of k-error linear complexity and linear complexity, here p is an odd prime and q is a primitive root modulo p2.
  • Keywords
    "Complexity theory","Genetic algorithms","Algorithm design and analysis","Sociology","Statistics","Approximation algorithms","Cryptography"
  • Publisher
    ieee
  • Conference_Titel
    Ubiquitous Intelligence and Computing and 2015 IEEE 12th Intl Conf on Autonomic and Trusted Computing and 2015 IEEE 15th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom), 2015 IEEE 12th Intl Conf on
  • Type

    conf

  • DOI
    10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.321
  • Filename
    7518502
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3781887