A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q) (Q2705945)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q) |
scientific article |
Statements
A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q) (English)
0 references
19 March 2001
0 references
codes
0 references
cryptography
0 references
periodic sequence
0 references
algorithm
0 references
linear complexity
0 references
