A method for computation of the discrete Fourier transform over a finite field

DOI10.1134/S0032946006020074zbMATH Open1237.94139MaRDI QIDQ415656FDOQ415656

Authors: S. V. Fedorenko 

Publication date: 9 May 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• A method for fast computation of the Fourier transform over a finite field
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
• Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics
• Finite-field wavelet transforms
• Conformal mappings between canonical multiply connected domains

Mathematics Subject Classification ID

Cyclic codes (94B15) Numerical methods for discrete and fast Fourier transforms (65T50) Decoding (94B35)

Cited In (2)

• Conformal mappings between canonical multiply connected domains
• Simple algorithms for decoding systematic Reed-Solomon codes

This page was built for publication: A method for computation of the discrete Fourier transform over a finite field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415656)