TY - GEN
T1 - On the k-operation linear complexity of periodic sequences
AU - Kavuluru, Ramakanth
AU - Klapper, Andrew
PY - 2007
Y1 - 2007
N2 - 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 double-struck F signq. 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.
AB - 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 double-struck F signq. 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.
KW - Linear complexity
KW - Periodic sequence
KW - k symbol deletion
KW - k symbol insertion
KW - k-error linear complexity
UR - https://www.scopus.com/pages/publications/38349025629
UR - https://www.scopus.com/pages/publications/38349025629#tab=citedBy
U2 - 10.1007/978-3-540-77026-8_24
DO - 10.1007/978-3-540-77026-8_24
M3 - Conference contribution
AN - SCOPUS:38349025629
SN - 9783540770251
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 322
EP - 330
BT - Progress in Cryptology - INDOCRYPT 2007 - 8th International Conference on Cryptology in India, Proceedings
T2 - 8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007
Y2 - 9 December 2007 through 13 December 2007
ER -