Marko J. Moisio

Algebraic Constructions of Optimal Frequency-Hopping Sequences

Frequency-hopping (FH) spread spectrum and direct-sequence spread spectrum are two main spread-coding technologies. Frequency-hopping sequences are needed in FH code-division multiple-access (CDMA) systems. In this correspondence, three classes of optimal frequency-hopping sequences are constructed with algebraic methods. The three classes are based on perfect nonlinear functions, power functions, and norm functions, respectively. Both individual optimal frequency-hopping sequences and optimal families of frequency-hopping sequences are presented.

Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm

Let

The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code

\F_q

Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros

(

On zeros of Kloosterman sums

q=p^r

Two recursive algorithms for computing the weight distribution of certain irreducible cyclic codes

) be a finite field. In this paper the number of irreducible polynomials of degree

On Certain Values of Kloosterman Sums

m

On Katz's bound for the number of elements with given trace and norm

in

On the Duals of Binary Hyper-Kloosterman Codes

\F_q[x]

A Comparision of the Number of Rational Places of Certain Function Fields to the Hasse-Weil Bounds

with prescribed trace and norm coefficients is calculated in certain special cases and a general bound for that number is obtained improving the bound by Wan if