Frequency hopping sequences

Purpose of this thesis is algebraic construction of frequency hopping sequences(FHS) which are needed for securing transmission of information in codes of Electronic, Telecommunication and Computer Engineering. It is studied for this purpose ve there is an detailed expression about constructions of generating FHS. In this expression,there are definitions of FHS, optimal FHS and criterions of optimality. There are also lower bounds for optimality. Algebraic constructions of optimal FHS are analysed in some papers. These constructions are abstracted quite well. Especially it is looked trace functions to form optimal FHS. This trace function is also an application of Finite Fields. The examples given in some papers are analysed too detailed. Some other examples are also analysed by the aid of MAGMA programme. Beyond these analyses, we looked at some other examples that it is not given in the papers. But there is no answer to this. We also looked at the proofs of theorems and lemmas, yet there is no proof in this thesis. We looked at just for some crude examples. In conclusion we did a clear comparison for the constructions. We did the table for distinguishing distinctions among parametres. And this table answered us exactly. One can find other parametres and other functions to construct like these optimal FHS.