A GENERALIZATION OF THE DISCRETE FOURIER-TRANSFORM - DETERMINING THE MINIMAL POLYNOMIAL OF A PERIODIC SEQUENCE

Authors
BLACKBURN SR
Citation
Sr. Blackburn, A GENERALIZATION OF THE DISCRETE FOURIER-TRANSFORM - DETERMINING THE MINIMAL POLYNOMIAL OF A PERIODIC SEQUENCE, IEEE transactions on information theory, 40(5), 1994, pp. 1702-1704
Citations number
6
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
40
Issue
5
Year of publication
1994
Pages
1702 - 1704
Database
ISI
SICI code
0018-9448(1994)40:5<1702:AGOTDF>2.0.ZU;2-Z
Abstract
Let s be a periodic sequence whose elements lie in a finite field. We present an algorithm that calculates the minimal polynomial of s, assu ming that a period of s is known. The algorithm generalises both the d iscrete Fourier transform and the Games-Chan algorithm.