We study a generalization of the Fourier-Mukai transform for smooth projective varieties. We nd conditions under which the transform satisses an inversion theorem. This is done by considering a series of four conditions on such transforms which increasingly constrain them. We show that a necessary condition for the existence of such transforms is that the rst Chern classes must vanish and the d...

A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform. A decoding technique for such codes is proposed. Index Terms – finite field Fourier transform, number theoretic transform, eigensequences, linear block codes.

We study a.e. convergence on L, and Lorentz spaces L, p > 2d d−1 , for variants of Riesz means at the critical index d( 1 2 − 1 p )− 1 2 . We derive more general results for (quasi-)radial Fourier multipliers and associated maximal functions, acting on L spaces with power weights, and their interpolation spaces. We also include a characterization of boundedness of such multiplier transformation...

Fractional Fourier transform (FRFT) is a generalization of the Fourier transform, rediscovered many times over the past 100 years. In this paper, we provide an overview of recent contributions pertaining to the FRFT. Specifically, the paper is geared toward signal processing practitioners by emphasizing the practical digital realizations and applications of the FRFT. It discusses threemajor top...

Fast algorithms for a wide class of non–separable n–dimensional (nD) discrete unitary K– transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix–2 FFT–type approach. The method utilizes a decomposition of the nDK–transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K–transforms. If the nD K–transform has a s...