• DocumentCode
    586699
  • Title

    On the linear complexity over Fp of quaternary sequences from binary Sidel´nikov 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
    615
  • Lastpage
    619
  • Abstract
    Recently, a quaternary sequence with optimal autocorrelation property is proposed by applying inverse Gray mapping to a pair of binary Sidel´nikov sequences. This quaternary sequence has even period and the maximum nontrivial autocorrelation magnitude is Rmax = 2, which is optimal and is the first quaternary sequences having Rmax = 2 for N ≡ 0 mod 4. In this paper, we present a closed-form representation of the linear complexity of the quaternary sequences over Fp for p ≥ 5.
  • Keywords
    binary sequences; binary Sidelnikov sequences; closed-form representation; inverse Gray mapping; linear complexity; maximum nontrivial autocorrelation magnitude; optimal autocorrelation property; quaternary sequences; Complexity theory; Computer science; Computers; Correlation; Discrete Fourier transforms; Educational institutions; USA Councils;
  • 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
    6401012
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=586699