• DocumentCode
    2618238
  • Title

    GF(q) sequences of period qn-1 with maximum linear complexity and maximum order complexities for minimum changes of m-sequences

  • Author

    Imamura, Kyoki ; Uehara, Satoshi ; Moriuchi, Tsutomu

  • Author_Institution
    Dept. of Comput. Sci. & Electron., Kyushu Inst. of Technol., Fukuoka, Japan
  • fYear
    1994
  • fDate
    27 Jun-1 Jul 1994
  • Firstpage
    366
  • Abstract
    Among GF(q) sequences of period N=qn-1 m-sequences are known to have minimum linear complexity (LC) of n. LCs for minimum changes of m-sequences are shown to be maximum, i.e. N. First it is shown that this maximum LC property is not peculiar to m-sequences if q≠2 or N is not prima. Secondly maximum order complexities (MOC) for minimum changes of m-sequences have reasonable values between n and 2n
  • Keywords
    Galois fields; computational complexity; sequences; Galois field sequences; m-sequences; maximum linear complexity; maximum order complexities; minimum changes; Codes; Open systems; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
  • Conference_Location
    Trondheim
  • Print_ISBN
    0-7803-2015-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1994.394652
  • Filename
    394652
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2618238