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


Vol. 33,  No. 1, pp. 6-11, Jan.  2008


PDF
  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.

  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 and K. Yang, "Linear Complexity of 1-Symbol Insertion Sequences from m-Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 1, pp. 6-11, 2008. DOI: .

[ACM Style]

Jin-Ho Chung and Kyeongcheol Yang. 2008. Linear Complexity of 1-Symbol Insertion Sequences from m-Sequences. The Journal of Korean Institute of Communications and Information Sciences, 33, 1, (2008), 6-11. DOI: .

[KICS Style]

Jin-Ho Chung and Kyeongcheol Yang, "Linear Complexity of 1-Symbol Insertion Sequences from m-Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 1, pp. 6-11, 1. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880