Advertisement

On the k-Operation Linear Complexity of Periodic Sequences

(Extended Abstract)
  • Ramakanth Kavuluru
  • Andrew Klapper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4859)

Abstract

Non-trivial lower bounds on the linear complexity are derived for a sequence obtained by performing k or fewer operations on a single period of a periodic sequence over \(\mathbb{F}_q\). An operation is a substitution, an insertion, or a deletion of a symbol. The bounds derived are similar to those previously established for either k substitutions, k insertions, or k deletions within a single period. The bounds are useful when T/2k < L < T/k, where L is the linear complexity of the original sequence and T is its period.

Keywords

Periodic sequence linear complexity k-error linear complexity k symbol insertion k symbol deletion 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jiang, S., Dai, Z., Imamura, K.: Linear complexity of a sequence obtained from a periodic sequence by either substituting, insertion or deleting k symbols within one period. IEEE Trans. Inf. Theory 44, 1328–1331 (1998)CrossRefGoogle Scholar
  2. 2.
    Meidl, W., Niederreiter, H.: Counting Functions and Expected Values for the k-error Linear Complexity. Finite Fields Appl. 8, 142–154 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Meidl, W., Niederreiter, H.: On the Expected Value of Linear Complexity and the k-error Linear Complexity of Periodic Sequences. IEEE Trans. Inf. Theory 48(11), 2817–2825 (2002)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Dai, S., Imamura, K.: Linear complexity for one-symbol substitution of a periodic sequence over GF(q). IEEE Trans. Inf. Theory 44, 1328–1331 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Uehara, S., Imamura, K.: Linear complexity of periodic sequences obtained from GF(q) sequences with period q n − 1 by one-symbol insertion. IEICE Trans. Fundamentals E79-A, 1739–1740 (1996)Google Scholar
  6. 6.
    Uehara, S., Imamura, K.: Linear complexity of peridic sequences obtained from a sequence over GF(p) with period p n − 1 by one-symbol deletion. IEICE Trans. Fundamentals E80-A, 1164–1166 (1997)Google Scholar
  7. 7.
    Uehara, S., Imamura, K.: Linear complexities of periodic sequences obtained from an m-sequence by two-symbol substitution. In: Proc. 1998 Int. Symp. Inf. Theory and Its Appl., Mexico City, Mexico, pp. 690–692 (October 1998) Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ramakanth Kavuluru
    • 1
  • Andrew Klapper
    • 1
  1. 1.Department of Computer Science, University of Kentucky, Lexington, KY, 40506USA

Personalised recommendations