New constructions of self-dual codes via twisted generalized Reed-Solomon codes (Q6086196)

A linear code \(\mathcal{C}\) with parameters \([n, k, d]\) is said to be maximum distance separable (MDS) code if \(d=n-k+1.\) The evaluation map with respect to \(\boldsymbol{\alpha}\) and \(\boldsymbol{v}\) is defined as \(e v_{\boldsymbol{\alpha}, \boldsymbol{v}}: \mathbb{F}_{q}[x] \times \mathbb{F}_{q}^{n} \rightarrow \mathbb{F}_{q}^{n},(f(x), \boldsymbol{\alpha}) \mapsto \boldsymbol{v} * f(\boldsymbol{\alpha}),\) where \(*\) is the componentwise product. Denote \(\mathcal{S}=\left\{\sum_{i=0}^{k-1} f_{i} x^{i}+\sum_{i=0}^{k-1} f_{i} \sum_{j=0}^{n-k-1} a_{i j} x^{k+j}: \text { for all } f_{i} \in \mathbb{F}_{q}, 0 \leq i \leq k-1\right\}\) the polynomial set. The linear code \(\mathcal{C} = \{ev_{\alpha,v}(f(x)) = (v_1 f (\alpha_1), \ldots, v_nf(\alpha_n)) : f (x)\in\mathcal{S}\}\) is called a twisted generalized Reed-Solomon (TGRS) code. If \(v = (1,\ldots, 1),\) then the linear code \(\mathcal{C}=\left\{e v_{\alpha}(f(x))=\left(f\left(\alpha_{1}\right), \ldots, f\left(\alpha_{n}\right)\right): f(x) \in \mathcal{S}\right\}\) is called a twisted Reed-Solomon (TRS) code. This paper studies what are the conditions under which the TRS code is MDS and shows a sufficient and necessary condition that a TRS code is MDS. The authors derive universal method to compute the parity check matrices of TRS codes. Sufficient and necessary condition that a TGRS code is self-dual is presented. Some new explicit constructions of self-dual TGRS codes are given as examples and it's shown that these self-dual TGRS codes are MDS, Near-MDS, or 2-MDS and most of them are non-GRS.