• DocumentCode
    1381670
  • Title

    A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)

  • Author

    Xiao, Guozhen ; Wei, Shimin ; Lam, Kwok Yan ; Imamura, Kyoki

  • Author_Institution
    Nat. Key Lab. of ISN, Xidian Univ., Xi´´an, China
  • Volume
    46
  • Issue
    6
  • fYear
    2000
  • fDate
    9/1/2000 12:00:00 AM
  • Firstpage
    2203
  • Lastpage
    2206
  • Abstract
    A fast algorithm is presented for determining the linear complexity of a sequence with period pn over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p2)
  • Keywords
    Galois fields; computational complexity; cryptography; number theory; sequences; GF(q); fast algorithm; linear complexity; number theory; sequences; Binary sequences; Equations; Feedback; Notice of Violation;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.868492
  • Filename
    868492
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1381670