Assume that q is a power of a prime number. Consider the field extension Fq⊂Fqn . Both fields can be thought as subfields of the algebraic closure of Fp, defined with
K=GF(p).algebraic_closure()The question is: Is it possible to compute a basis of Fqn over Fq ? Or at least to have something in the spirit of
K.<x1,...,xn>=GF(q)[]which can be done when q is prime?
You can always do find these elements
sage: a = K.multiplicative_generator()
sage: basis = [a**i for i in range(dim)]where K is your finite field and dim is the dimension of your vector space (or the codimension of the ground field sitting inside the big one).
Vincent
Asked: 9 years ago
Seen: 1,221 times
Last updated: Jun 09 '15
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
What do you mean by a basis? Suppose you have
sage: K = GF(q,'a'). Then you can typesage: (L,f) = K.extension(2,'b',map=True)to get inLthe finite field with q^2 elements, defined as an extensionK. Andfgives you the embedding ofKinsideL.I am interested in finding n elements of Fqn linear-independent over Fq, even when q is not prime.