Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex> (Q3546689)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Algorithms for Determining the Linear Complexity of Sequences Over&lt;tex&gt;$hboxGF,(p^m)$&lt;/tex&gt;With Period&lt;tex&gt;$2^tn$&lt;/tex&gt; |
scientific article |
Statements
Fast Algorithms for Determining the Linear Complexity of Sequences Over&lt;tex&gt;$hboxGF,(p^m)$&lt;/tex&gt;With Period&lt;tex&gt;$2^tn$&lt;/tex&gt; (English)
0 references
21 December 2008
0 references
