Browse > Article

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

Chung, Jin-Ho (포항공과대학교 전자전기공학과 통신 및 신호설계 연구실)
Yang, Kyeong-Cheol (포항공과대학교 전자전기공학과 통신 및 신호설계 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.31, no.12C, 2006 , pp. 1150-1156 More about this Journal
Abstract
In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over $F_p$ of M-ary Sidel'nikov sequences of period $p^m-1$ when $M\geq3$ and $p\equiv{\pm}1$ mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when $p^m-1$ and $m\geq4$. 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.
Keywords
linear complexity; k-error linear complexity; Sidel'nikov sequences; M-ary sequences;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Stamp and C. Martin, 'An algorithm for the $\kappa$-error linear complexity of binary sequences with period $2^{n}$,' IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1398-1401, July 1993   DOI   ScienceOn
2 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
3 Y.-S. Kim, J.-S. Chung, J.-S. No, and H. Chung, 'Linear complexity over $F_{P}$ of Mary Sidel'nikov sequences,' ;제 15회 통신정보 합동학술대회 (JCCI 2005) 논문집, 대구, 2005년 4월, 제 15권, pp. 100
4 Y.-S. Kim, J.-S. Chung, J.-S. No, and H. Chung, 'On the linear complexity over $F_{P}$ of Mary Sidel'nikov sequences,' in Proc. 2005 IEEE Inter. Symp. Inform. Theory, Adelaide, Australia, Sep. 2005, pp. 2007-2011
5 P. J. Cameron, Combinatorics: topics, techniques, algorithms, Cambridge University Press, 1994
6 T. Helleseth, M Maas, J. E. Mathiassen, and T. Segers, 'Linear complexity over $F_{P}$of Sidel'nikov sequences,' IEEE Trans. Inform. Theory, vol. 50, no, 10, pp. 2468-2472, Oct. 2004   DOI   ScienceOn
7 R. E. Blahut, 'Transform techniques for error control codes,' IBM J. Res. Develop., vol. 23, pp. 299-315, May 1979   DOI   ScienceOn
8 Y-C. Eun, H.-Y. Song, and G. Kyureghyan, '1-Error linear complexity over $F_{P}$of Sidelnikov sequences,' Lecture Notes in Computer Science, vol. 3486, Sequences and Their Applications 2004, Springer, pp. 154-165, Mar. 2005
9 T. Helleseth and K. Yang, 'On binary sequences of period $p^{m}$-1 with optimal autocorrelation,' Sequences and Their Applications 2001, Discrete Mathematics and Theoretical Computer Science, Springer, pp. 209-217, Aug. 2001
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
11 V. M. Sidel'nikov, 'Some $\kappa$-valued pseudo-random sequences and nearly equidistant codes,' Probl. Inf. Transm., vol. 5, no. 1, pp. 12-16, Jan. 1969