Title :
A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
Author :
Blackburn, Simon R.
Author_Institution :
Dept. of Math., R. Holloway & Bedford New Coll., Egham, UK
fDate :
9/1/1994 12:00:00 AM
Abstract :
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
Keywords :
codes; computational complexity; fast Fourier transforms; minimisation; polynomials; Games-Chan algorithm; algorithm; discrete Fourier transform; finite field; minimal polynomial; periodic sequence; Discrete Fourier transforms; Fourier transforms; Galois fields; Information security; Mathematics; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
