Recursive construction of primitive polynomials over finite fields

Abstract

In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n{2}^k(k=1,2,3,\dots )$ over ${\mathbb{F}}_q$ is given.

There is some problems in the proof of some theorems