On evaluating the linear complexity of a sequence of least period \(2^ n\) (Q1329115)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On evaluating the linear complexity of a sequence of least period \(2^ n\) |
scientific article |
Statements
On evaluating the linear complexity of a sequence of least period \(2^ n\) (English)
0 references
4 September 1994
0 references
feedback shift register
0 references
algorithm
0 references
linear complexity
0 references
