On the linear complexity over Fp of quaternary sequences from binary Sidel'nikov sequences

Young Sik Kim, Ji Woong Jang, Sang Hyo Kim, Jong Seon No

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publication2012 International Symposium on Information Theory and Its Applications, ISITA 2012
Pages615-619
Number of pages5
StatePublished - 2012
Event2012 International Symposium on Information Theory and Its Applications, ISITA 2012 - Honolulu, HI, United States
Duration: 28 Oct 201231 Oct 2012

Publication series

Name2012 International Symposium on Information Theory and Its Applications, ISITA 2012

Conference

Conference2012 International Symposium on Information Theory and Its Applications, ISITA 2012
Country/TerritoryUnited States
CityHonolulu, HI
Period28/10/1231/10/12

Fingerprint

Dive into the research topics of 'On the linear complexity over Fp of quaternary sequences from binary Sidel'nikov sequences'. Together they form a unique fingerprint.

Cite this