Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) (Q947101): Difference between revisions

@@ Property / cites work @@
+Completely normal elements in iterated quadratic extensions of finite fields
+Normal rank
@@ Property / cites work @@
+The explicit construction of irreducible polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
+Normal rank
@@ Property / cites work @@
+Finding Isomorphisms Between Finite Fields
@@ Property / cites work: Finding Isomorphisms Between Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Q3773973
@@ Property / cites work: Q3773973 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3136478
@@ Property / cites work: Q3136478 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit N-polynomials of \(2\)-power degree over finite fields. I
+Normal rank
@@ Property / cites work @@
+Q4876403
@@ Property / cites work: Q4876403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4314377
@@ Property / cites work: Q4314377 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798760
@@ Property / cites work: Q3798760 / rank @@
+Normal rank
@@ Property / cites work @@
+CONSTRUCTION OF POLYNOMIALS IRREDUCIBLE OVER A FINITE FIELD WITH LINEARLY INDEPENDENT ROOTS
+Normal rank
@@ Property / cites work @@
+Q3724438
@@ Property / cites work: Q3724438 / rank @@
+Normal rank