A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.) (Q3964019)
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 determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for determining the complexity of a binary sequence with period&lt;tex&gt;2^n&lt;/tex&gt;(Corresp.) |
scientific article |
Statements
A fast algorithm for determining the complexity of a binary sequence with period&lt;tex&gt;2^n&lt;/tex&gt;(Corresp.) (English)
0 references
1983
0 references
linear feedback shift register
0 references
