Computing m DFTs over GF(q) with one DFT over GF(q/sup m/)

DOI10.1109/18.179373zbMath0763.65104DBLPjournals/tit/HongV93OpenAlexW1948626422WikidataQ59341807 ScholiaQ59341807MaRDI QIDQ4034468

Martin Vetterli, Jonathan Hong

Publication date: 16 May 1993

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

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

zbMATH Keywords

complexityfinite fieldsdiscrete Fourier transforms

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Finite fields and commutative rings (number-theoretic aspects) (11T99) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

This page was built for publication: Computing m DFTs over GF(q) with one DFT over GF(q/sup m/)