|
Problemy Peredachi Informatsii, 2006, Volume 42, Issue 2, Pages 81–93
(Mi ppi43)
|
|
|
|
This article is cited in 24 scientific papers (total in 24 papers)
Coding Theory
A Method for Computation of the Discrete Fourier Transform over a Finite Field
S. V. Fedorenko Saint-Petersburg State Polytechnical University
Abstract:
The discrete Fourier transform over a finite field finds applications in algebraic
coding theory. The proposed computation method for the discrete Fourier transform is based
on factorizing the transform matrix into a product of a binary block circulant matrix and a
diagonal block circulant matrix.
Received: 12.07.2005 Revised: 09.03.2006
Citation:
S. V. Fedorenko, “A Method for Computation of the Discrete Fourier Transform over a Finite Field”, Probl. Peredachi Inf., 42:2 (2006), 81–93; Problems Inform. Transmission, 42:2 (2006), 139–151
Linking options:
https://www.mathnet.ru/eng/ppi43 https://www.mathnet.ru/eng/ppi/v42/i2/p81
|
|