A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\) (Q2705945)
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 linear complexity of a sequence with period \(p^n\) over GF\((q)\) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\) |
scientific article |
Statements
19 March 2001
0 references
codes
0 references
cryptography
0 references
periodic sequence
0 references
algorithm
0 references
linear complexity
0 references
A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\) (English)
0 references
