• DocumentCode
    1367700
  • Title

    Linear complexity for one-symbol substitution of a periodic sequence over GF(q)

  • Author

    Dai, Zongduo ; Imamura, Kyoki

  • Author_Institution
    Dept. of Math., Acad. Sinica, Beijing, China
  • Volume
    44
  • Issue
    3
  • fYear
    1998
  • fDate
    5/1/1998 12:00:00 AM
  • Firstpage
    1328
  • Lastpage
    1331
  • Abstract
    It is shown that the linear complexity for one-symbol substitution of any periodic sequence over GF(q) can be computed without any condition on the minimal polynomial of the sequence
  • Keywords
    computational complexity; information theory; sequences; GF(q); linear complexity; minimal polynomial; one-symbol substitution; periodic sequence; Computer science; Information security; Laboratories; Mathematics; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.669427
  • Filename
    669427
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1367700