A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q) (Q4677595)
From MaRDI portal
scientific article; zbMATH DE number 2167312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q) |
scientific article; zbMATH DE number 2167312 |
Statements
A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q) (English)
0 references
11 May 2005
0 references
