"An efficient prime-length DFT algorithm over finite fields ..."

Wilfried Gappmair (2003)

> Home

Details and statistics

DOI: 10.1002/ETT.909

access: closed

type: Journal Article

metadata version: 2020-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ett/Gappmair03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ett/Gappmair03
Wilfried Gappmair:
An efficient prime-length DFT algorithm over finite fields GF(2^m). Eur. Trans. Telecommun. 14(2): 171-176 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.