Photo from archive.org
For the discrete Fourier transform with respect to the system of characters of a local field with positive characteristic, we propose a fast algorithm. We find the complexity of the… Click to show full abstract
For the discrete Fourier transform with respect to the system of characters of a local field with positive characteristic, we propose a fast algorithm. We find the complexity of the algorithm.
Keywords:
local fields;
positive characteristic;
fourier transform;
transform local;
discrete fourier;
fast discrete
Journal Title: Problems of Information Transmission
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Problems of Information Transmission
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!