On the k-Operation Linear Complexity of Periodic Sequences

DOI10.1007/978-3-540-77026-8_24MaRDI QIDQ5458219zbMATH OpenOpenAlexFDO

Authors Ramakanth Kavuluru, Andrew Klapper

Publication date 11 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77026-8_24

zbMATH Keywords

linear complexity\(k\)-error linear complexity\(k\) symbol deletion\(k\) symbol insertionPeriodic sequence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 2127875
• Linear complexity of periodic sequences: a general theory
• Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences
• On the calculation of the linear complexity of periodic sequences
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Cryptography and Coding
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
• New Results on Periodic Sequences With Large $k$-Error Linear Complexity
• Periodic sequences with large k-error linear complexity

Cites work

• Counting functions and expected values for the \(k\)-error linear complexity
• Linear complexity for one-symbol substitution of a periodic sequence over GF(q)
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences

Cited in

(2)

• On the calculation of the linear complexity of periodic sequences
• Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period

This page was built for publication: On the k-Operation Linear Complexity of Periodic Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458219)