#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1994

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Cunsheng Ding, Marko J. Moisio, Jin Yuan
- IEEE Transactions on Information Theory
- 2007

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)… (More)

- Marko J. Moisio, Kalle Ranto
- Finite Fields and Their Applications
- 2007

We apply relations of n-dimensional Kloosterman sums to exponential sums over finite fields to count the number of low-weight codewords in a cyclic code with two zeros. As a corollary we obtain a new… (More)

- Marko J. Moisio, Keijo O. Väänänen
- IEEE Trans. Information Theory
- 1999

Two recursive algorithms for computing the weight distributions of certain binary irreducible cyclic codes of lengthn in the so-called index 2 case are presented. The running times of these… (More)

- Petr Lisonek, Marko J. Moisio
- Des. Codes Cryptogr.
- 2011

A Kloosterman zero is a non-zero element of $${{\mathbb F}_q}$$ for which the Kloosterman sum on $${{\mathbb F}_q}$$ attains the value 0. Kloosterman zeros can be used to construct monomial hyperbent… (More)

- Marko J. Moisio
- 1997

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

- Marko J. Moisio
- IEEE Transactions on Information Theory
- 2007

In this correspondence, we give the moments of a Kloosterman sum over Fq in terms of the frequencies of weights in the binary Zetterberg code of length q+1, which are known by the work of Schoof and… (More)

- Marko J. Moisio
- Finite Fields and Their Applications
- 2007

We calculate the exact number of rational points on certain families of Fermat curves defined over Fq2 or Fq3 . If q is even we consider also a family of Fermat curves over Fq3 which is closely… (More)

- Marko J. Moisio
- Finite Fields and Their Applications
- 2009

Let m be a positive integer, let r be a prime such that 2 is a primitive root modulo r, and let q = 2(r−1)r m−1 . In this note a binomial exponential sum over Fq which assumes 3 2 log2 q + 2 distinct… (More)

- Marko J. Moisio
- Finite Fields and Their Applications
- 2009

In a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums K(a) over a finite field F2m were evaluated modulo 24 in the case m odd, and the number of those a giving the same value for K(a)… (More)

Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed

- Marko J. Moisio, Kalle Ranto
- Finite Fields and Their Applications
- 2008

Let Fq be a finite field of characteristic p = 2, 3. We give the number of irreducible polynomials x + am−1x m−1 + · · · + a0 ∈ Fq[x] with am−1 and am−3 prescribed for any given m if p = 2, and with… (More)