• DocumentCode
    935936
  • Title

    A fast algorithm for determining the complexity of a binary sequence with period 2^n (Corresp.)

  • Author

    Games, Richard A. ; Chan, Agnes Hui

  • Volume
    29
  • Issue
    1
  • fYear
    1983
  • fDate
    1/1/1983 12:00:00 AM
  • Firstpage
    144
  • Lastpage
    146
  • Abstract
    The complexity of a periodic sequence (s) is defined to be the least number of stages in a linear feedback shift register that generates (s) .
  • Keywords
    Shift-register sequences; Binary sequences; Channel coding; Distortion measurement; Image coding; Linear feedback shift registers; Mathematics; Phase change materials; Quantization; Source coding; Technological innovation;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1983.1056619
  • Filename
    1056619
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=935936