Period of sequences of primitive polynomials
B. Park, Hojin Choi, T. Chang, Kil-Sun Kang · Electronics Letters · 1993
An efficient algorithm for the construction of primitive polynomials over GF(q) has been proposed by Di Porto et al. The algorithm generates a sequence of primitive polynomials. Computer experiments have examined the periods of the sequences. In the Letter, an explicit solution to the determination of the period is given.