Browse > Article

Linear Complexity of 1-Symbol Insertion Sequences from m-Sequences  

Chung, Jin-Ho (포항공과대학교 전자전기공학과 통신 및 신호설계 연구실)
Yang, Kyeong-Cheol (포항공과대학교 전자전기공학과 통신 및 신호설계 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.33, no.1C, 2008 , pp. 6-11 More about this Journal
Abstract
From a periodic sequence, we can obtain new sequences with a longer period by r-symbol insertion to each period. In this paper we review previous results on the linear complexity of periodic sequences obtained by r-symbol insertion. We derive the distribution of the linear complexity of 1-symbol insertion sequences obtained from m-sequences over GF(p), and prove some relationship between their linear complexity and the insertion position. Then, we analyze the k-error linear complexity of the 1-symbol insertion sequences from binary m-sequences.
Keywords
Linear complexity; p-ary sequences; m-sequences; 1-symbol insertion;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. A. Games and A. H. Chan, "A fast algorithm for determining the complexity of a binary sequence with period $2^{n}$," IEEE Trans. Inform. Theory, vol. 29, no. 1, pp. 144-146, Jan 1983   DOI
2 S. W. Golomb and G. Gong, Signal Design for Good Correlation: for wireless communications, cryptography and radar applications. Cambridge University Press, 2005
3 S. Jiang, Z. Dai, and K. Imamura, "Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period," IEEE Trans. Inform. Theory, vol. 46, no. 3, pp. 1174-1177, May 2000   DOI   ScienceOn
4 M. Stamp and C. Martin, "An algorithm for the k-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
5 S. W. Golomb, Shift Register Sequences. Laguna Hills, CA: Aegean Park Press, 1982
6 P. V. Kumar and V. K. Wei, "Minimum distance of logarithmic and fractional partial m-sequences," IEEE Trans. Inform. Theory, vol. 38, no. 5, pp. 1474-1482, Sep. 1992   DOI   ScienceOn
7 S. Uehara and K. Imamura, "Linear complexity of periodic sequences obtained from GF(p) sequences with period $q^{n}$-1 by one-symbol insertion," IEICE Trans. Fund., vol. E79-A, no. 10, pp. 1739-1740, Oct. 1996
8 K. Imamura, T. Moriuchi, and S. Uehara, "Periodic sequences of the maximum linear complexity simply obtained from an m-sequence," in Proc. IEEE 1991 Inter. Symp. Inform. Theory, June 1991, pp. 175
9 K. Kurosawa, F. Sato, T. Sakata, and W. Kishimoto, "Relationship between linear complexity and k-error linear complexity," IEEE Trans. Inform. Theory, vol. 46, no. 3, pp. 694-698, Mar. 2000   DOI   ScienceOn