A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377): Difference between revisions

@@ Property / cites work @@
+Systolic VLSI Arrays for Polynomial GCD Computation
+Normal rank
@@ Property / cites work @@
+Finding Isomorphisms Between Finite Fields
@@ Property / cites work: Finding Isomorphisms Between Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Q3765876
@@ Property / cites work: Q3765876 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Shift-register synthesis and BCH decoding
@@ Property / cites work: Shift-register synthesis and BCH decoding / rank @@
+Normal rank
@@ Property / cites work @@
+Q3773322
@@ Property / cites work: Q3773322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038771
@@ Property / cites work: Q4038771 / rank @@
+Normal rank
@@ Property / cites work @@
+A method for solving key equation for decoding goppa codes
+Normal rank
@@ Property / cites work @@
+Constructing normal bases in finite fields
@@ Property / cites work: Constructing normal bases in finite fields / rank @@
+Normal rank
@@ Property / cites work @@
+VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>)
+Normal rank