A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q) (Q4677595)
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 2167312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9271341562271118
0 references
0.9267017245292664
0 references
0.9262508153915404
0 references
0.8977912068367004
0 references
