The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

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

최대주기 수열의 1-심볼 추가 선형복잡도

  • 정진호 (포항공과대학교 전자전기공학과 통신 및 신호설계 연구실) ;
  • 양경철 (포항공과대학교 전자전기공학과 통신 및 신호설계 연구실)
  • Published : 2008.01.31
Download PDF
⟨ Previous Next ⟩

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.

주기 수열에서 각 주기의 임의의 위치에 r개의 심볼을 추가하는 경우, 더 긴 주기를 가지는 수열을 얻을 수 있다. 본 논문에서는 주기 수열에 r개의 심볼을 추가한 수열의 선형복잡도에 대한 기존 결과들을 정리하고 GF(p)상에서 정의된 최대주기 수열에 1개의 심볼을 추가함으로써 얻어지는 수열들의 선형복잡도의 분포를 분석한다. 그리고 이진 최대주기 수열들의 1-심볼 추가 k-오류 선형복잡도에 대한 새로운 사실들을 유도함으로써 수열의 안정성을 평가한다.

Keywords

References

  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 https://doi.org/10.1109/TIT.1983.1056619
  2. S. W. Golomb, Shift Register Sequences. Laguna Hills, CA: Aegean Park Press, 1982
  3. S. W. Golomb and G. Gong, Signal Design for Good Correlation: for wireless communications, cryptography and radar applications. Cambridge University Press, 2005
  4. 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
  5. 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 https://doi.org/10.1109/18.841203
  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 https://doi.org/10.1109/18.149498
  7. 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 https://doi.org/10.1109/18.825845
  8. 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 https://doi.org/10.1109/18.243455
  9. 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