1. Linear complementary pairs of codes over rings
- Author
-
Peng Hu and Xiusheng Liu
- Subjects
Principal ideal ring ,Ring (mathematics) ,Mathematics::Commutative Algebra ,Applied Mathematics ,Commutative ring ,Characterization (mathematics) ,Quantitative Biology::Genomics ,Computer Science Applications ,Combinatorics ,Finite field ,Chain (algebraic topology) ,Principal ideal ,Computer Science::Data Structures and Algorithms ,Mathematics - Abstract
In this work, we first prove a necessary and sufficient condition for a pairs of linear codes over finite rings to be linear complementary pairs (abbreviated to LCPs). In particular, a judging criterion of free LCP of codes over finite commutative rings is obtained. Using the criterion of free LCP of codes, we construct a maximum-distance-separable (MDS) LCP of codes over ring $$\mathbb {Z}_4$$ . Then, all the possible LCP of codes over chain rings are determined. We also generalize the criterions for constacyclic and quasi-cyclic LCP of codes over finite fields to constacyclic and quasi-cyclic LCP of codes over chain rings. Finally, we give a characterization of LCP of codes over principal ideal rings. Under suitable conditions, we also obtain the judging criterion for a pairs of cyclic codes over principal ideal rings $$\mathbb {Z}_{k}$$ to be LCP, and illustrate a MDS LCP of cyclic codes over the principal ideal ring $$\mathbb {Z}_{15}$$ .
- Published
- 2021
- Full Text
- View/download PDF