A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
Simon R. Blackburn⋆ · IEEE Transactions on Information Theory · 1994
Let s be a periodic sequence whose elements lie in a finite field. The authors present an algorithm that calculates the minimal polynomial of s, assuming that a period of s is known. The algorithm generalises both the discrete Fourier transform and the Games-Chan algorithm.>