Lower bounds on error complexity measures for periodic LFSR and FCSR sequences (Q1032491): Difference between revisions

@@ Property / cites work @@
+Linear complexity for one-symbol substitution of a periodic sequence over GF(q)
+Normal rank
@@ Property / cites work @@
+The stability theory of stream ciphers
@@ Property / cites work: The stability theory of stream ciphers / rank @@
+Normal rank
@@ Property / cites work @@
+The expectation and variance of the joint linear complexity of random periodic multisequences
+Normal rank
@@ Property / cites work @@
+On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
+Normal rank
@@ Property / cites work @@
+On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
+Normal rank
@@ Property / cites work @@
+Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
+Normal rank
@@ Property / cites work @@
+Feedback shift registers, 2-adic span, and combiners with memory
+Normal rank
@@ Property / cites work @@
+A relationship between linear complexity and k-error linear complexity
+Normal rank
@@ Property / cites work @@
+Counting functions and expected values for the \(k\)-error linear complexity
+Normal rank
@@ Property / cites work @@
+On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
+Normal rank
@@ Property / cites work @@
+The expected value of the joint linear complexity of periodic multisequences
+Normal rank
@@ Property / cites work @@
+How many bits have to be changed to decrease the linear complexity?
+Normal rank
@@ Property / cites work @@
+Error linear complexity measures for multisequences
+Normal rank