• DocumentCode
    586697
  • Title

    Linear complexity of quaternary sequences constructed from binary Legendre sequences

  • Author

    Young-Sik Kim ; Ji-woong Jang ; Sang-Hyo Kim ; Jong-Seon No

  • Author_Institution
    Dept. Inf. & Commun. Eng., Chosun Univ., Gwangju, South Korea
  • fYear
    2012
  • fDate
    28-31 Oct. 2012
  • Firstpage
    611
  • Lastpage
    614
  • Abstract
    In this paper, we derive the linear complexity of the quaternary sequences proposed by Kim, Jang, Kim, and No. Because the period of the quaternary sequences is 2p, we introduce the discrete Fourier transform over the finite field Fqm which is a splitting field of x2p - 1. It turns out that the linear complexity over Fqm of the quaternary sequence constructed from the Legendre sequence is p or 2p - 1.
  • Keywords
    binary codes; binary sequences; discrete Fourier transforms; linear codes; binary Legendre sequence; discrete Fourier transform; finite field; linear complexity; quaternary sequence; splitting field; Complexity theory; Correlation; Cryptography; Discrete Fourier transforms; Educational institutions; Multiaccess communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and its Applications (ISITA), 2012 International Symposium on
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    978-1-4673-2521-9
  • Type

    conf

  • Filename
    6401010
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=586697