New constructions of self-dual codes via twisted generalized Reed-Solomon codes
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.
- A class of twisted generalized Reed-Solomon codes
- Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes
- scientific article; zbMATH DE number 1026591 (Why is no real title available?)
- Introduction to Coding Theory
- MDS and near-MDS codes via twisted Reed-Solomon codes
- MDS or NMDS LCD codes from twisted Reed-Solomon codes
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes
- New LCD MDS Codes of Non-Reed-Solomon Type
- New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
- On the constructions of MDS self-dual codes via cyclotomy
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Twisted Reed–Solomon Codes
- A class of twisted generalized Reed-Solomon codes
- New Results on Self-Dual Generalized Reed-Solomon Codes
- A class of double-twisted generalized Reed-Solomon codes
- The \((+)\)-extended twisted generalized Reed-Solomon code
- The \([1, 0]\)-twisted generalized Reed-Solomon code
- Lifting iso-dual algebraic geometry codes
- Construction of MDS Euclidean self-dual codes via multiple subsets
- Coding properties and automorphism groups of two classes of twisted generalized Reed-Solomon codes
- Two classes of twisted generalized Reed-Solomon codes with two twists
- New MDS codes of non-GRS type and NMDS codes
- New self-dual codes from TGRS codes with general twists
- A generic construction on self-orthogonal algebraic geometric codes and its applications
- MDS and NMDS codes from extended codes of extended twisted Reed-Solomon codes
This page was built for publication: New constructions of self-dual codes via twisted generalized Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086196)
