LCP of matrix product codes

Abstract

In this paper, we firstly present a new criterion of linear complementary pairs (abbreviated to LCP) of codes over finite fields. Our result for the linear complementary pairs of codes extends the criterion of linear complementary dual (LCD) codes given by Massey. Then, two methods to construct LCP of codes from matrix product codes are provided, and concrete examples are presented to construct good parameters of LCP of codes.

Keywords:

• Matrix product codes
• LCP of codes
• finite fields

2020 Mathematics Subject Classifications:

• 94B05
• 94B15

Acknowledgments

The authors would like to sincerely thank the editor and the referees for very meticulous readings of this paper, and for valuable suggestions which help us to create an improved version. X. Liu was supported by Research Funds of Hubei Province (Grant No. Q20174503), and Research Project of Hubei Polytechnic University (Grant No. numbers 17xjz03A). H. Liu was supported by Doctoral Scientific Research Foundation of Hubei University of Technology (Grant No. BSQD2020111).

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

X. Liu was supported by Research Funds of Hubei Province (Grant No. Q20174503), and Research Project of Hubei Polytechnic University (Grant No. numbers 17xjz03A). H. Liu was supported by Doctoral Scientific Research Foundation of Hubei University of Technology (Grant No. BSQD2020111).