Referenced Items are not available for this document.
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
Published in:
Information Theory, IEEE Transactions on
(Volume:40
,
Issue:
5
)
Date of Publication: Sep 1994
- Page(s):
- 1702 - 1704
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 4820679
- Digital Object Identifier :
- 10.1109/18.333898
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Sep 1994
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
