Abstract

For an odd prime powerq the infinite field GF(q 2 ∞)= ⋃ n≥0 GF (q 2n ) is explicitly presented by a sequence (f n)≥1 ofN-polynomials. This means that, for a suitably chosen initial polynomialf 1, the defining polynomialsf n∈GF(q)[x] of degrees2 n are constructed by iteration of the transformation of variablex→x+1/x and have linearly independent roots over GF(q). In addition, the sequences are trace-compatible in the sense that the relative traces map the corresponding roots onto each other. In this first paper the caseq≡1 (mod 4) is considered and the caseq≡3 (mod 4) will be dealt with in a second paper. This specific construction solves a problem raised by A. Scheerhorn in [11].

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.