Period of sequences of primitive polynomials

An efficient algorithm for the construction of primitive polynomials over GF(q) has been proposed by Di Porto el al. (see ibid., vol.28, no.2, p.118-20, 1992). The algorithm generates a sequence of primitive polynomials. Computer experiments have examined the periods of the sequences. The authors give an explicit solution to the determination of the period.