Reducing the calculation of the linear complexity of $u_2^v$-periodic binary sequences to Games-Chan algorithm (Q1008964): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10623-007-9134-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1985421175
@@ Property / OpenAlex ID: W1985421175 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Determining the Linear Complexity of Sequences Over&amp;lt;tex&amp;gt;$hboxGF,(p^m)$&amp;lt;/tex&amp;gt;With Period&amp;lt;tex&amp;gt;$2^tn$&amp;lt;/tex&amp;gt;
+Normal rank
@@ Property / cites work @@
+Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$
+Normal rank
@@ Property / cites work @@
+Q4208589
@@ Property / cites work: Q4208589 / rank @@
+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 @@
+A fast algorithm for determining the complexity of a binary sequence with period&amp;lt;tex&amp;gt;2^n&amp;lt;/tex&amp;gt;(Corresp.)
+Normal rank
@@ Property / cites work @@
+Shift-register synthesis and BCH decoding
@@ Property / cites work: Shift-register synthesis and BCH decoding / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
+Normal rank
@@ Property / cites work @@
+The expected value of the joint linear complexity of periodic multisequences
+Normal rank
@@ Property / cites work @@
+Progress in Cryptology - INDOCRYPT 2003
@@ Property / cites work: Progress in Cryptology - INDOCRYPT 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis and design of stream ciphers
@@ Property / cites work: Analysis and design of stream ciphers / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
+Normal rank
@@ Property / cites work @@
+Q4417388
@@ Property / cites work: Q4417388 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1008964

Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964): Difference between revisions

Latest revision as of 09:59, 1 July 2024

Statements

Sitelinks

Mathematics(1 entry)