Twisted linearized Reed-Solomon codes: a skew polynomial framework (Q2168840)

Let \(\mathbb{F}\) be a subfield of \(\mathbb{L},\) then the \(\mathbb{F}\)-linear sum-rank metric code \(\mathcal{C}\subseteq \mathbb{L}[X ;\theta]/(H_{\Lambda}(X))\) is called maximum sum-rank distance (MSRD) if its parameters meet the Singleton-like bound \(\dim_{\mathbb{F}}\mathcal{C}\leq [\mathbb{L}:\mathbb{F}](\ell_n-\text{d}_{\Lambda}+1).\) A few constructions of MSRD codes are known so far, the most prominent one is family of linearized Reed-Solomon codes. Extending these results the author introduces the new family of twisted linear Reed-Solomon codes. Let \(k, n, \ell\) be positive integers with \(1\leq k\leq \ell_n,\) \(\Lambda=\{\lambda_1,\ldots, \lambda_{\ell}\}\subseteq \mathbb{K}^\ast\) be a finite set. Furthermore, let \(\eta \in \mathbb{L}\) such that \((-1)^{kn} N_{\mathbb{L}/ \mathbb{K}}\) is not contained in \(\langle \Lambda\rangle^\ast,\) and let \(0\leq h\leq n-1.\) The code \[ \mathcal{L}_k^{\theta}(\eta, h)=\{f_0+\cdots+f_{k-1}X^{k-1}+\eta\theta^h(f_0)X^k: f_i\in\mathbb{L}\}\subseteq\mathbb{L}[X;\theta]/(H_{\Lambda}(X)) \] is called a twisted linearized Reed-Solomon code. These proposed constructions strongly rely on the framework that is developed for studying codes in the sum-rank metric. The author propose to study codes in the sum-rank metric as subsets of a particular quotient algebra of skew polynomials, which can be seen as a different interpretation of the skew metric. It is shown that this framework is isometric to the natural frameworks of sum-rank metric codes. Furthermore, the sum-rank metric codes are defined in this setting, where linearized Reed-Solomon codes can be seen as the natural analogue of Reed-Solomon and Gabidulin codes, generated by all the skew polynomials of bounded degree. A study of equivalence of sum-rank metric codes is provided and the notions of adjoint of a skew polynomial and its associated Dickson matrix are introduced. It is proved that twisted linearized Reed-Solomon codes are MSRD codes and in the special case of block length equal to one, the construction can be adapted to obtain a new family of additive MDS codes in the Hamming metric. The dual and adjoint codes of the new codes are derived.