A class of p-ary cyclic codes and their weight enumerators

Abstract: Let

m

,

k

be positive integers such that

f r a c m g c d (m, k) g e q 3

,

p

be an odd prime and

p i

be a primitive element of

m a t h b b F_{p^{m}}

. Let

h_{1} (x)

and

h_{2} (x)

be the minimal polynomials of

- p i^{- 1}

and

p i^{- f r a c p^{k} + 1 2}

over

m a t h b b F_{p}

, respectively. In the case of odd

f r a c m g c d (m, k)

, when

k

is even,

g c d (m, k)

is odd or when

f r a c k g c d (m, k)

is odd, Zhou et~al. in cite{zhou} obtained the weight distribution of a class of cyclic codes

m a t h c a l C

over

m a t h b b F_{p}

with parity-check polynomial

h_{1} (x) h_{2} (x)

. In this paper, we further investigate this class of cyclic codes

m a t h c a l C

over

m a t h b b F_{p}

in the rest case of odd

f r a c m g c d (m, k)

and the case of even

f r a c m g c d (m, k)

. Moreover, we determine the weight distribution of cyclic codes

m a t h c a l C

.

Recommendations

Cites Work

Cited In (7)

This page was built for publication: A class of \(p\)-ary cyclic codes and their weight enumerators