The complexity of a periodic sequence over GF(p) (Q1113874)
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: The complexity of a periodic sequence over GF(p) |
scientific article; zbMATH DE number 4081461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of a periodic sequence over GF(p) |
scientific article; zbMATH DE number 4081461 |
Statements
The complexity of a periodic sequence over GF(p) (English)
0 references
1988
0 references
Some algorithms for finding the complexity and the connection polynomial of the shortest linear feedback shift register that generates a periodic sequence over GF(p) are proposed.
0 references
feedback shift register
0 references
periodic sequence
0 references
