A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence (Q2860219)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence |
scientific article; zbMATH DE number 6230587
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence |
scientific article; zbMATH DE number 6230587 |
Statements
19 November 2013
0 references
cryptology
0 references
multisequence
0 references
feedback shift register
0 references
2-adic joint complexity
0 references
A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence (English)
0 references
