A class of twisted generalized Reed-Solomon codes

Abstract: Let

m a t h b b F_{q}

be a finite field of size

q

and

m a t h b b F_{q}^{*}

the set of non-zero elements of

m a t h b b F_{q}

. In this paper, we study a class of twisted generalized Reed-Solomon code

C_{e} l l (D, k, e t a, v e c v) s u b s e t m a t h b b F_{q}^{n}

generated by the following matrix [ left(�egin{array}{cccc} v_{1} & v_{2} & cdots & v_{n} \ v_{1} alpha_{1} & v_{2} alpha_{2} & cdots & v_{n} alpha_{n} \ vdots & vdots & ddots & vdots \ v_{1} alpha_{1}^{ell-1} & v_{2} alpha_{2}^{ell-1} & cdots & v_{n} alpha_{n}^{ell-1} \ v_{1} alpha_{1}^{ell+1} & v_{2} alpha_{2}^{ell+1} & cdots & v_{n} alpha_{n}^{ell+1} \ vdots & vdots & ddots & vdots \ v_{1} alpha_{1}^{k-1} & v_{2} alpha_{2}^{k-1} & cdots & v_{n} alpha_{n}^{k-1} \ v_{1}left(alpha_{1}^{ell}+etaalpha_{1}^{q-{2}} ight) & v_{2}left(alpha_{2}^{ell}+ eta alpha_{2}^{q-2} ight) &cdots & v_{n}left(alpha_{n}^{ell}+etaalpha_{n}^{q-2} ight) end{array} ight) ] where

0 l e q e l l l e q k - 1,

the evaluation set

D = a l p h a_{1}, a l p h a_{2}, c d o t s, a l p h a_{n} s u b s e t e q m a t h b b F_{q}^{*}

, scaling vector

v e c v = (v_{1}, v_{2}, c d o t s, v_{n}) i n (m a t h b b F_{q}^{*})^{n}

and

e t a i n m a t h b b F_{q}^{*}

. The minimum distance and dual code of

C_{e} l l (D, k, e t a, v e c v)

will be determined. For the special case

e l l = k - 1,

a sufficient and necessary condition for

C_{k - 1} (D, k, e t a, v e c v)

to be self-dual will be given. We will also show that the code is MDS or near-MDS. Moreover, a complete classification when the code is near-MDS or MDS will be presented.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: A class of twisted generalized Reed-Solomon codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2153755)