Linear complementary pairs of codes over rings (Q2234463): Difference between revisions

Let \(C\) and \(D\) are two linear codes of length \(n\) over finite commutative ring with identity \(R\) such that \(C\cap D = \{0\}\) and \(C\oplus D = R^n,\) then we call such \((C, D)\) a linear complementary pair (LCP) of codes over \(R.\) LCP code are of particular interest for their applications in cryptography. This work introduces a generalization of LCP of codes over finite fields to LCP of codes over finite rings and a criterion for LCP of linear codes over finite rings is shown. In particular, free LCP of codes over finite commutative rings are characterized. Using the characterization of free LCP of codes, a maximum distance separable LCP of codes over ring \(\mathbb{Z}_4\) is constructed as an example. The authors give a necessary and sufficient condition for a pair of linear codes over finite chain rings to be LCP. Special attention is devoted to investigate constacyclic and quasi-cyclic LCP of codes over finite chain rings. As a result a characterizations for LCP of constacyclic codes and LCP of quasi-cyclic codes is obtained. This result for the constacyclic and quasi-cyclic complementary pairs extends the characterization of LCP of constacyclic and quasi-cyclic codes known before. Lastly, some results about general LCP of codes and free cyclic LCD codes over principal ideal rings are established.