The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials

Abstract: Let

m g e q 3

be an odd integer and

p

be an odd prime. % with

p - 1 = 2^{r} h

, where

h

is an odd integer. In this paper, many classes of three-weight cyclic codes over

m a t h b b F_{p}

are presented via an examination of the condition for the cyclic codes

m a t h c a l C_{(1, d)}

and

m a t h c a l C_{(1, e)}

, which have parity-check polynomials

m_{1} (x) m_{d} (x)

and

m_{1} (x) m_{e} (x)

respectively, to have the same weight distribution, where

m_{i} (x)

is the minimal polynomial of

p i^{- i}

over

m a t h b b F_{p}

for a primitive element

p i

of

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

. %For

p = 3

, the duals of five classes of the proposed cyclic codes are optimal in the sense that they meet certain bounds on linear codes. Furthermore, for

p e q u i v 3 p m o d 4

and positive integers

e

such that there exist integers

k

with

g c d (m, k) = 1

and

a u i n 0, 1, c d o t s, m - 1

satisfying

(p^{k} + 1) c d o t e e q u i v 2 p^{a u} p m o d p^{m} - 1

, the value distributions of the two exponential sums

T (a, b) = s u m l i m i t s_{x i n m a t h b b F_{p^{m}}} o m e g a^{T r (a x + b x^{e})}

and

S (a, b, c) = s u m l i m i t s_{x i n m a t h b b F_{p^{m}}} o m e g a^{T r (a x + b x^{e} + c x^{s})},

where

s = (p^{m} - 1) / 2

, are settled. As an application, the value distribution of

S (a, b, c)

is utilized to investigate the weight distribution of the cyclic codes

m a t h c a l C_{(1, e, s)}

with parity-check polynomial

m_{1} (x) m_{e} (x) m_{s} (x)

. In the case of

p = 3

and even

e

satisfying the above condition, the duals of the cyclic codes

m a t h c a l C_{(1, e, s)}

have the optimal minimum distance.

Cited In (34)

This page was built for publication: The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials