On the Number of Distinct Autocorrelation Distributions of M-ary Sidel'nikov Sequences 


Vol. 32,  No. 10, pp. 929-934, Oct.  2007


PDF
  Abstract

In this paper, we enumerate the number of distinct autocorrelation distributions that M-ary Sidel'nikov sequences can have, while we change the primitive element for generating the sequence. Let p be a prime and M|pn-1. For M=2, there is a unique autocorrelation distribution. If M>2 and M|pk+1 for some k, 1≤k<n, then the autocorrelation distribution of M-ary Sidel'nikov sequences is unique. If M>2 and Młpk+1 for any k, 1≤k<n, then the autocorrelation distribution of M-ary Sidel'nikov sequences is less than or equal to Ø(M)k′(or Ø(M)2k′), where k′ is the smallest integer satisfying M|pk′-1.

  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, Y. Kim, J. No, H. Chung, "On the Number of Distinct Autocorrelation Distributions of M-ary Sidel'nikov Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 10, pp. 929-934, 2007. DOI: .

[ACM Style]

Jung-Soo Chung, Young-Sik Kim, Jong-Seon No, and Ha-Bong Chung. 2007. On the Number of Distinct Autocorrelation Distributions of M-ary Sidel'nikov Sequences. The Journal of Korean Institute of Communications and Information Sciences, 32, 10, (2007), 929-934. DOI: .

[KICS Style]

Jung-Soo Chung, Young-Sik Kim, Jong-Seon No, Ha-Bong Chung, "On the Number of Distinct Autocorrelation Distributions of M-ary Sidel'nikov Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 10, pp. 929-934, 10. 2007.