An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences (Q2860223)
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: An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences |
scientific article; zbMATH DE number 6230591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences |
scientific article; zbMATH DE number 6230591 |
Statements
19 November 2013
0 references
periodic multisequences
0 references
error linear complexity
0 references
generalized discrete Fourier transform
0 references
0.92323315
0 references
0.9093274
0 references
0.9001698
0 references
0.8964482
0 references
0.8963249
0 references
0 references
0.8936498
0 references
0.8923376
0 references
An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences (English)
0 references
