• DocumentCode
    1256893
  • Title

    The linear complexity of binary sequences with period (2n-1)k

  • Author

    Hua, Cheng ; Xiao, Guo-zhen

  • Author_Institution
    Dept. of Math., Northern Jiaotong Univ., Beijing, China
  • Volume
    37
  • Issue
    3
  • fYear
    1991
  • fDate
    5/1/1991 12:00:00 AM
  • Firstpage
    672
  • Lastpage
    673
  • Abstract
    In recent years, some new generators of binary sequences, such as the clock-controlled shift register and the cascade-connected clock-controlled shift register, have been suggested. Most sequences generated by these models have period of the form (2n-1)k. Further, many other kinds of binary sequences have this kind of period. Here, the authors give the lower bound of linear complexity of all these kinds of sequences that have period of the form (2n-1)k with n being a prime.
  • Keywords
    binary sequences; binary sequences; cascade connected shift register; clock-controlled shift register; linear complexity; lower bound; Binary sequences; Cities and towns; Clocks; Mathematics; Polynomials; Shift registers;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.79929
  • Filename
    79929
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1256893