LCP of rank metric codes and its an application (Q6046158)

Two linear codes \(C, D\) of length \(n\) over \(\mathbb{F}_{q^m}\) are called an Linear complementary pair (LCP) if \(C\cap D=\{0\}\) and \(C+D=\mathbb{F}_{q^m}^n.\) Moreover if \(C\) and \(D\) are Gabidulin codes and LCP then we call LPC of Gabidulin codes. In particular, if the two codes Gabidulin MRD codes, then \((C, D)\) is called an MRD LCP of Gabidulin codes. In this paper, the relationship between LCP of Delsarte codes and LCP of Gabidulin codes is established. A novel criterion for Gabidulin codes \((C, D)\) to be LCP is derived and as an application of this criterion two classes of LCP MRD of Gabidulin codes are presented. Let \(n\leq m\) then, the author proves, that \(C\) is a Gabidulin MRD code if and only if \(\mathbf{C}_{\mathcal{G}}(C)\subset \mathbb{F}_q^{n\times m}\) is a Delsarte MRD code. Moreover, a necessary and sufficient condition for \((C, D)\) to be an MRD LCP of Gabidulin codes is that the dual pair \((C^\bot, D^\bot),\) is also an MRD LCP of Gabidulin codes. An interesting application of rank-metric LCP MRD of Gabidulin codes in coding for the two-user binary adder channel is shown.