Galois LCD subspace codes
Using a uniform method, complementary dual subspace codes in a more general setting (which are called \(s\)-Galois LCD subspace codes) are studied. In [\textit{Y. Fan} and \textit{L. Zhang}, Des. Codes Cryptography 84, No. 3, 473--492 (2017; Zbl 1381.94135)], the \(s\)-Galois form on \(\mathbb{F}_{q}^{n}\) is introduced as follows: for each integer \(s\) with \(0 \leq s<e\), \([\mathbf{x}, \mathbf{y}]_{s}=x_{1} y_{1}^{p^{s}}+\cdots+x_{n} y_{n}^{p^{s}}\), for all \(\mathbf{x}, \mathbf{y} \in \mathbb{F}_{q}^{n}. \) This form coincides with the Euclidean inner product if \(s = 0\), and it is the Hermitian inner product if \(e\) is even and \(s =\frac{e}{2}\). One can define the \(s\)-Galois dual \(\mathcal{C}^{\bot_s}\) of a code \(\mathcal{C}\), and then \(C\) is said to be an \(s\)-Galois linear complementary dual (LCD) code if the intersection of the code with its \(s\)-Galois dual is trivial.\N\NLet \(\mathcal{P}_q (n)\) be the set of all the subspaces of \(\mathbb{F}^n_q\), and \(\mathcal{C}\subset\mathcal{P}_q(n)\) be a subspace code. If \(C_i\cap C_j^{\bot_s}=\{0\}\), for all \(C_i ,C_j\in\mathcal{C}\), then \(\mathcal{C}\) is called an \(s\)-Galois LCD subspace code. In particular, if every element of \(\mathcal{C}\) is a \(\lambda\)-constacyclic code, then \(\mathcal{C}\) is called an \(s\)-Galois LCD \(\lambda\)-constacyclic subspace code.\N\NA necessary and sufficient condition for a subspace code to be an \(s\)-Galois LCD subspace code is determined, as follows: Let \(C_i\) and \(C_j\) be any two linear codes in \(\mathcal{C}\) with generator matrix \(G_i\), then \(\mathcal{C}\) is an \(s\)-Galois LCD subspace code if and only if \(G_i (G_j^{(p^{e-s})})^T\) is right-invertible. Using this condition, a sufficient condition under which a \(\lambda\)-constacyclic subspace code is an \(s\)-Galois LCD subspace code, is also established.\N\NA criterion for a subspace code over finite fields to be an \(s\)-Galois LCD subspace code is shown, and a sufficient condition for a \(\lambda\)-constacyclic subspace code to be an \(s\)-Galois LCD \(\lambda\)-constacyclic subspace code under certain conditions, is given.\N\NA definition of the matrix code \(\mathbb{F}_q^{n\times m}(U)\) from the linear code \(U\) over \(\mathbb{F}_q\) is given. Further, assuming that \(\mathbb{F}_q^{n\times m}(\mathcal{C})=\{\mathbb{F}_q^{n\times m}(U)\mid U \in\mathcal{C}\}\) where \(\mathcal{C} = C_i\) is a set of linear codes over \(\mathbb{F}_q\) for \(i = 1, 2, \ldots, M\), it's proven that the set \(\mathbb{F}_q^{n\times m}(\mathcal{C})\) is an \(s\)-Galois LCD subspace code if and only if \(\mathcal{C}\) is an \(s\)-Galois LCD subspace code. \(s\)-Galois LCD subspace codes by using the matrix-product codes over \(\mathbb{F}_q\) are constructed.\N\NSufficient examples of \(s\)-Galois LCD and \(\lambda\)-constacyclic subspace code over finite fields are given to illustrate the main results. The authors do not specify which computer software was used for the calculation of these examples.
- A note on the intersection of two distinct constacyclic codes
- Complementary dual codes for counter-measures to side-channel attacks
- Constructions of good entanglement-assisted quantum error correcting codes
- Galois LCD codes over finite fields
- Galois self-dual constacyclic codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- LCD subspace codes
- Linear codes with complementary duals
- Matrix-product codes over \(\mathbb{F}_q\)
- New EAQEC codes constructed from Galois LCD codes
- Note on Niederreiter-Xing's propagation rule for linear codes
- Rank-metric codes and their duality theory
This page was built for publication: Galois LCD subspace codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892129)
