LCP of constacyclic codes over finite chain rings

Let R be a finite commutative chain ring with unity and be a unit in lambda. In this paper, all non-trivial linear complementary pair (LCP) of lambda-constacyclic codes of arbitrary length over R have been completely determined. An expression for the total number of non-trivial LCP of lambda-constacyclic codes of length n over R has also been derived in terms of the maximum number of factors of x(n) - lambda into monic, pairwise coprime polynomials of degree >= 1 over R. Further, using the algebraic structure of lambda-constacyclic codes over finite chain rings of nilpotency index 2 as an alternative approach, the complete characterization of non-trivial LCP of lambda-constacyclic codes is obtained for such rings. As an illustration of our results, a few examples of non-trivial LCP of constacyclic codes over the rings Z(8), Z(4) and the Galois ring GR(4, 3) have been given.