An Efficient Prime-Length DFT Algorithm over Finite Fields GF(2^m)

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)171-176
JournalEuropean transactions on telecommunications
Volume14
Issue number2
Publication statusPublished - 2003

Treatment code (Nähere Zuordnung)

  • Theoretical

Cite this