The Gray image of constacyclic codes over the finite chain ring F_p^m[u]/ u^k

Abstract: Let

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

be a finite field of cardinality

p^{m}

, where

p

is a prime, and

k, N

be any positive integers. We denote

R_{k} = F_{p^{m}} [u] / l a n g l e u^{k} a n g l e = F_{p^{m}} + u F_{p^{m}} + l d o t s + u^{k - 1} F_{p^{m}}

(

u^{k} = 0

) and

l a m b d a = a_{0} + a_{1} u + l d o t s + a_{k - 1} u^{k - 1}

where

a_{0}, a_{1}, l d o t s, a_{k - 1} i n F_{p^{m}}

satisfying

a_{0} e q 0

and

a_{1} = 1

. Let

r

be a positive integer satisfying

p^{r - 1} + 1 l e q k l e q p^{r}

. We defined a Gray map from

R_{k}

to

F_{p^{m}}^{p^{r}}

first, then prove that the Gray image of any linear

l a m b d a

-constacyclic code over

R_{k}

of length

N

is a distance invariant linear

a_{0}^{p^{r}}

-constacyclic code over

F_{p^{m}}

of length

p^{r} N

. Furthermore, the generator polynomials for each linear

l a m b d a

-constacyclic code over

R_{k}

of length

N

and its Gray image are given respectively. Finally, some optimal constacyclic codes over

F_{3}

and

F_{5}

are constructed.

Recommendations

Cites work

Cited in

(18)

This page was built for publication: The Gray image of constacyclic codes over the finite chain ring \(F_{p^m}[u]/\langle u^k\rangle \)