A class of twisted generalized Reed-Solomon codes
Abstract
Let Fq be a finite field of size q and Fq* the set of non-zero elements of Fq. In this paper, we study a class of twisted generalized Reed-Solomon code C(D, k, η, v)⊂ Fqn generated by the following matrix \[ (arraycccc v1 & v2 & ·s & vn \\ v1 α1 & v2 α2 & ·s & vn αn \\ & & & \\ v1 α1-1 & v2 α2-1 & ·s & vn αn-1 \\ v1 α1+1 & v2 α2+1 & ·s & vn αn+1 \\ & & & \\ v1 α1k-1 & v2 α2k-1 & ·s & vn αnk-1 \\ v1(α1+ηα1q-2) & v2(α2+ η α2q-2) &·s & vn(αn+ηαnq-2) array) \] where 0≤ ≤ k-1, the evaluation set D=\α1,α2,·s, αn\⊂eq Fq*, scaling vector v=(v1,v2,·s,vn)∈ (Fq*)n and η∈Fq*. The minimum distance and dual code of C(D, k, η, v) will be determined. For the special case =k-1, a sufficient and necessary condition for Ck-1(D, k, η, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.