Two classes of twisted generalized Reed-Solomon codes with two twists
Let \(V\) be a \(k\)-dimensional \(\mathbb{F}_{q}\)-linear subspace of \(\mathbb{F}_{q}[x]\) and \(\alpha_{1}, \ldots, \alpha_{n}\) be distinct elements in \(\mathbb{F}_{q}\) and \(\alpha=\left(\alpha_{1}, \ldots, \alpha_{n}\right)\). Let \(v_{1}, \ldots, v_{n}\in\mathbb{F}_q^\ast\) and \(v=(v_{1}, \ldots, v_{n})\), define the evaluation map of \(\operatorname{ev}_\alpha:V\to \mathbb{F}_q^n\). Define the set of \((k, t, h, \eta)\)-twisted polynomials as \N\[ \NS_{k, t, h, \eta}=\left\{f(x)=\sum_{i=0}^{k-1} a_i x^i+\sum_{j=1}^l \eta_j a_{h_j} x^{k-1+t_j} \mid a_{i} \in \mathbb{F}_{q} \text { for } 0 \le i \le k-1\right\}.\N\] \NThe twisted generalized Reed-Solomon (TGRS) code of length \(n\) and dimension \(k\) is defined as \(C_{k, n}(\alpha, v, \eta)=e v_{\alpha, v}(S)\). In most cases, the TGRS codes are not necessarily MDS. Most of TGRS MDS codes are not GRS codes when the code rate is less than one-half. A linear code \(C\) is defined as a linear complementary dual (LCD) code when \(\mathrm{Hull(C)}=C\cap C^\bot=\{0\}\). A linear \([n,k,d]\) code achieving the bound \(d=n-k+1\) is called maximum distance separable (MDS), and if \(d=n-k+2\) the code is said to be near maximum distance separable (NMDS).\N\NWhen \(k\geq 2\), \(l = 2\), \(h = (0, 0)\), \(\eta=(\eta_1, \eta_2) \in(\mathbb{F}_q^\ast)^2\), \(n- k > 2\) and \(t = (1, 2)\), the code is defined as \(C_{k, n}^{(1)}(\alpha, v, \eta)=\operatorname{ev}_\alpha(S_1)\). The construction \(C_{k, n}^{(2)}(\alpha, v, \eta)=\operatorname{ev}_\alpha(S_2)\) is achieved when \(n-k > 3\) and \(t = (1, 3)\). The authors give sufficient and necessary conditions for the TGRS codes \(C_{k, n}^{(1)}(\alpha, v, \eta)\) with dimension \(k\), the hook \(h=(0,0)\) and the twist \(t=(1,2)\) and \(C_{k, n}^{(2)}(\alpha, v, \eta)\) with dimension \(k\), the hook \(h=(0,0)\) and the twist \(t=(1,3)\) to be MDS. A further study of when TGRS codes \(C_{k, n}^{(1)}(\alpha, v, \eta)\) and \(C_{k, n}^{(2)}(\alpha, v, \eta)\) are self-orthogonal is performed and new sufficient and necessary conditions are derived.\N\NAlso several classes of LCD codes via TGRS codes are studied. Additionally, LCD MDS codes are investigated, and several kinds of new LCD codes are constructed, which are MDS or NMDS with parameters \([8,2,7]\), \([8,3,6]\), \([10,2,9]\), \([6,2,5]\) and \([9,3,6]\).
- A class of double-twisted generalized Reed-Solomon codes
- A new family of linear maximum rank distance codes
- A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes
- Complementary Dual Algebraic Geometry Codes
- Complementary dual codes for counter-measures to side-channel attacks
- Construction of MDS self-dual codes over finite fields
- Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
- Constructions of optimal LCD codes over large finite fields
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- Euclidean and Hermitian LCD MDS codes
- Fundamentals of Error-Correcting Codes
- Galois LCD codes over finite fields
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 6765484 (Why is no real title available?)
- LCD codes from tridiagonal Toeplitz matrices
- LCD Cyclic Codes Over Finite Fields
- MDS or NMDS LCD codes from twisted Reed-Solomon codes
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- MDS self-dual codes over large prime fields
- MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes
- New Characterization and Parametrization of LCD Codes
- New Constructions of MDS Codes With Complementary Duals
- New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes
- New constructions of self-dual codes via twisted generalized Reed-Solomon codes
- New constructions of self-dual generalized Reed-Solomon codes
- New LCD MDS codes constructed from generalized Reed-Solomon codes
- New LCD MDS Codes of Non-Reed-Solomon Type
- New MDS Euclidean Self-Orthogonal Codes
- New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
- New MDS self-dual codes over finite fields
- New MDS self-dual codes over finite fields of odd characteristic
- New self-dual codes from TGRS codes with general twists
- On parity-check matrices of twisted generalized Reed-Solomon codes
- On twisted generalized Reed-Solomon codes with \(\ell\) twists
- Orthogonal designs and MDS self-dual codes
- The \([1, 0]\)-twisted generalized Reed-Solomon code
- Twisted Reed–Solomon Codes
This page was built for publication: Two classes of twisted generalized Reed-Solomon codes with two twists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007882)