• DocumentCode
    1208263
  • Title

    Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences

  • Author

    Helleseth, Tor ; Kim, Sang-Hyo ; No, Jong-Seon

  • Author_Institution
    Dept. of Informatics, Univ. of Bergen, Norway
  • Volume
    49
  • Issue
    6
  • fYear
    2003
  • fDate
    6/1/2003 12:00:00 AM
  • Firstpage
    1548
  • Lastpage
    1552
  • Abstract
    In this article, the linear complexity over Fp of Lempel-Cohn-Eastman (1977) sequences of period pm-1 for an odd prime p is determined. For p=3,5, and 7, the exact closed-form expressions for the linear complexity over Fp of LCE sequences of period pm-1 are derived. Further, the trace representations for LCE sequences of period pm-1 for p=3 and 5 are found by computing the values of all Fourier coefficients in Fp for the sequences.
  • Keywords
    binary sequences; computational complexity; CDMA communication systems; Fourier coefficients; Lempel-Cohn-Eastman sequences; binary sequence; code-division multiple-access; exact closed-form expressions; linear complexity; stream ciphers; trace representation; Autocorrelation; Binary sequences; Closed-form solution; Computer science; Councils; Galois fields; Informatics; Multiaccess communication; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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