• DocumentCode
    2454928
  • Title

    An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)

  • Author

    Zhou, Jianqin

  • Author_Institution
    Anhui Univ. of Technol., Ma´´anshan
  • fYear
    2007
  • fDate
    23-27 Sept. 2007
  • Firstpage
    104
  • Lastpage
    108
  • Abstract
    We first optimize the structure of the Wei-Xiao-Chen algorithm for the linear complexity of sequences over GF(q) with period N = 2pn, where p and q are odd primes, and q is a primitive root ( mod p2). Then the union cost is used, so that an efficient algorithm for computing k-error linear complexity of a sequence with period 2pn over GF(q) is derived, where p and q are odd primes, and q is a primitive root of modulo p2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.
  • Keywords
    information theory; sequences; information theory; k-error linear complexity; periodic sequence; Artificial intelligence; Books; Computer science; Costs; Cryptography; Current measurement; Logic; Time measurement; Periodic sequence; k-error linear complexity; linear complexity;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Design and Its Applications in Communications, 2007. IWSDA 2007. 3rd International Workshop on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4244-1074-3
  • Electronic_ISBN
    978-1-4244-1074-3
  • Type

    conf

  • DOI
    10.1109/IWSDA.2007.4408335
  • Filename
    4408335
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2454928