A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence

DOI10.1109/18.333898zbMath0811.94027OpenAlexW2137049485MaRDI QIDQ4324161

Simon R. Blackburn

Publication date: 1 March 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.333898

zbMATH Keywords

algorithmfinite fielddiscrete Fourier transformminimal polynomiallinear complexityperiodic sequenceGames-Chan algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (2)

Linear Complexity of Periodic Sequences: A General Theory ⋮ An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime

This page was built for publication: A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence