Linear Complexity and 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences 


Vol. 31,  No. 12, pp. 1150-1156, Dec.  2006


PDF
  Abstract

In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over Fp of M-ary Sidel'nikov sequences of period pm-1 when M≥3 and p≡±1 mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when p≡-1 mod 3 and m≥4. Based on these bounds we present the asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Chung and K. Yang, "Linear Complexity and 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 12, pp. 1150-1156, 2006. DOI: .

[ACM Style]

Jin-Ho Chung and Kyeongcheol Yang. 2006. Linear Complexity and 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences. The Journal of Korean Institute of Communications and Information Sciences, 31, 12, (2006), 1150-1156. DOI: .

[KICS Style]

Jin-Ho Chung and Kyeongcheol Yang, "Linear Complexity and 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 12, pp. 1150-1156, 12. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880