We show that it is possible to de ne Hartley-like transforms for (generalized) character tables of nite groups. This large class of transforms include Hartley transforms for discrete Fourier transforms over abelian groups and Hartley-like transforms for the discrete cosine transform of type I.

Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequences. We extend a wellknown relationship between the linear complexity of an N -periodic sequence ...

Leaf identification is a challenging research. So far, many approaches have been proposed. In this paper, an approach that combines Fourier descriptors with other shape features was investigated to identify 100 hundred kinds of leaves. The result shows that the combination of Fourier descriptors and several other shape features can be used to identify leaves with the accuracy rate of 88%. This ...

We give a detailed study of the discrete Fourier transform (DFT) of r-even arithmetic functions, which form a subspace of the space of r-periodic arithmetic functions. We consider the DFT of sequences of r-even functions, their mean values and Dirichlet series. Our results generalize properties of the Ramanujan sum. We show that some known properties of r-even functions and of the Ramanujan sum...