Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

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 …

We give a short and elementary proof of the fact that for a linear complementary pair (C, D),
where C and D are 2-sided ideals in a group algebra, D is uniquely determined by C and the …

In this paper, we first generalize the complementary pair of codes over finite fields to an l-
linear complementary pair (l-LCP) of codes. Then two criteria of l-LCP of codes over finite …

Linear complementary dual (LCD) codes and linear complementary pair (LCP) of codes
over finite fields have been intensively studied recently due to their applications in …

Linear complementary pair (abbreviated to LCP) of codes were defined by Ngo et al. in
2015, and were proved that these pairs of codes can help to improve the security of the …

Abstract A pair (C, D) of group codes in R [G] is called a linear complementary pair
(abbreviated to LCP) if C⊕ D= R [G], where R is a finite Frobenius ring, and G is a finite …

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 …

In this paper, we study dihedral codes with 1-dimensional hulls and we determine precisely
when dihedral codes over finite fields with 1-dimensional hulls exist. Moreover, we show that …

Linear complementary dual (LCD) codes and linear complementary pairs (LCP) of codes
have been proposed for new applications as countermeasures against side-channel attacks …