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

Research output: Contribution to journalArticleResearchpeer-review

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

An Efficient Prime-Length DFT Algorithm over Finite Fields GF(2^m). / Gappmair, Wilfried.

In: European transactions on telecommunications, Vol. 14, No. 2, 2003, p. 171-176.

Research output: Contribution to journalArticleResearchpeer-review

@article{6aac94ffd12241d68cbed03d0fa864d8,
title = "An Efficient Prime-Length DFT Algorithm over Finite Fields GF(2^m)",
author = "Wilfried Gappmair",
year = "2003",
language = "English",
volume = "14",
pages = "171--176",
journal = "European transactions on telecommunications",
issn = "1124-318X",
publisher = "Associazione Elettrotecnica ed Elettronica Italiana",
number = "2",

}

TY - JOUR

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

AU - Gappmair, Wilfried

PY - 2003

Y1 - 2003

M3 - Article

VL - 14

SP - 171

EP - 176

JO - European transactions on telecommunications

JF - European transactions on telecommunications

SN - 1124-318X

IS - 2

ER -