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 the normal view instead:
scientific article; zbMATH DE number 1578553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\) |
scientific article; zbMATH DE number 1578553 |
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
0.9267017245292664
0 references
0.9210875034332277
0 references
0.9205281138420104
0 references
