• DocumentCode
    939415
  • Title

    Construction of de Bruijn sequences of minimal complexity

  • Author

    Etzion, Tuvi ; Lempel, Abraham

  • Volume
    30
  • Issue
    5
  • fYear
    1984
  • fDate
    9/1/1984 12:00:00 AM
  • Firstpage
    705
  • Lastpage
    709
  • Abstract
    It is well known that the linear complexity of a de Bruijn sequence S of length 2^{n} is bounded below by 2^{n- 1} + n for n \\geq 3 . It is shown that this lower bound is attainable for all n .
  • Keywords
    Sequences; Computer science; Helium; Polynomials; Registers; State feedback;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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