Linear complementary pairs of codes over a finite non-commutative Frobenius ring

From MaRDI portal





Let~\(R\) be a finite, not necessarily commutative ring with identity. A \textit{linear code} of length~\(n\) is a right submodule of~\(R^n\). Two such codes \(C, D\) form a \textit{linear complementary pair} (LCP) if \(C + D = R^n\) and \(C \cap D = \{ 0 \}\). The ring is \textit{Frobenius} if its quotient modulo the radical is isomorphic as right module to its socle. In this case, the ring is quasi-Frobenius and for the \textit{dual code}~\(C^{\perp}\) given as the left-annihilator of~\(C\) there holds \(\vert C \vert \vert C^{\perp} \vert = \vert R^n \vert\).\N\NThis paper investigates various properties for LCPs of codes over a finite non-commutative Frobenius ring. For local such rings one has the natural homomorphism onto a finite field, and characterizations of the LCP property in terms of this canonical reduction are given. These results should be taken with care, as they seem not to hold with such generality as stated.\N\NLCPs of codes over finite non-commutative Frobenius rings are also studied by means of the injective envelope, employing elementary properties of essential submodules. Finally, some basic results on the dual code~\(C^{\perp}\) are provided if the code~\(C\) is generated by an idempotent square matrix. Several examples are given to illustrate the various concepts.











This page was built for publication: Linear complementary pairs of codes over a finite non-commutative Frobenius ring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989207)