An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime (Q1854286)
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 algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime |
scientific article; zbMATH DE number 1853048
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime |
scientific article; zbMATH DE number 1853048 |
Statements
An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime (English)
0 references
14 January 2003
0 references
\(k\)-error linear complexity
0 references
sequences
0 references
Games-Chan algorithm
0 references
0 references
0.9486362
0 references
0.9345529
0 references
0.9269017
0 references
0.9210202
0 references
