Browse > Article

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

Chung, Jung-Soo (서울대학교 전기.컴퓨터공학부 및 뉴미디어통신공동연구소)
Kim, Young-Sik (삼성전자)
No, Jong-Seon (서울대학교 전기.컴퓨터공학부 및 뉴미디어통신공동연구소)
Chung, Ha-Bong (홍익대학교 전자전기공학부)
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|p^n-1$. For M=2, there is a unique autocorrelation disuibution. If M>2 and $M|p^k+1$ for some k, $1{\leq}k2 and $M{\nmid}p^k+1$ for any k, $1{\leq}k, where k' is the smallest integer satisfying $M|p^{k.
Keywords
Autocorrelation; Autocorrelation Distributions; Cyclotomic Number; M-ary Sequences; Sidel'nikov Sequences;
Citations & Related Records
연도 인용수 순위
  • Reference
1 V. M. Sidel'nikov, 'Some k-valued pseudorandom sequences and nearly equidistant codes,' Probl. Inf. Transm., vol. 5, no. 1, pp. 12-16, 1969
2 Y.-S. Kim, J.-S. Chung, J.-S. No, and H. Chung, 'On the autocorrelation distributions of Sidel'nikov sequences,' IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3303-3307, Sep. 2005   DOI   ScienceOn
3 L.D. Baumert, W.H. Mills, and R.L. Ward, 'Uniform cyclotomy,' J. Number Theory, vol. 14, pp. 67-82, 1982   DOI
4 L. E. Dickson, 'Cyclotomy, higher congruences, and Waring's problem,' Amer. J. Math., vol. 57, pp. 391-424, 1935   DOI   ScienceOn
5 R. Lidl and H. Niederreiter, Finite Fields, vol. 20 of Encyclopedia of Mathematics and Its Applications Reading, MA: Addison-Wesley, 1983
6 R. J. McEliece and H. C. Rumsey, 'Euler products, cyclotomy, and coding,' J. Number Theory, vol. 4, pp. 302-311, 1972   DOI
7 Tae-Hyung Lim, Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, and Habong Chung, 'On the relationship of Sidel'nikov sequences,' ISITA 2006(International Symposium on Information Theory and its Applications, Seoul, Korea), Oct. 29 - Nov. 1, 2006, pp. 934-937
8 T. Storer, Cyclotomy and Difference Sets, Lectures in Advanced Mathematics Chicago, IL: Markham, 1967
9 T. Helleseth, S.-H. Kim, and J.-S. No, 'Linear complexity over $F_p$ and trace representation of Lempel-Cohn-Eastman sequences,' IEEE Trans. Inform. Theory, vol. 49, no. 6, pp. 1548-1552, June 2003   DOI   ScienceOn
10 A. Lempel, M. Cohn, and W. L. Eastman, 'A class of balanced binary sequences with optimal autocorrelation properties,' IEEE Trans. Inform. Theory, vol. 23, no. 1, pp. 38-42, Jan. 1977   DOI