A note on Kloosterman sums and its application

The number of times the trace of a certain function on an extension field assumes a fixed value in the base field is considered. It is shown that the set of all such values enjoys a Fourier transform like property with Kloosterman sums. The application of this property to coding and cryptography is briefly discussed.