Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters for LCPs of codes are defined as the (Hamming) distance and the dual distance of the codes in the pair. We study the properties of LCPs of skew constacyclic codes, since their algebraic structure provides tools for studying their duals and their distances. As a result, we give a characterization for those pairs, as well as multiple results that lead to constructing pairs with designed security parameters. We extend skew BCH codes to a constacyclic context and show that an LCP of codes can be immediately constructed from a skew BCH constacyclic code. Additionally, we describe a Hamming weight-preserving automorphism group in the set of skew constacyclic codes, which can be used for constructing LCPs of codes.

翻译：线性互补对偶(LCPs)码自被引入以来，因其在讨论集成电路硬件攻击防护措施背景下的应用而受到广泛研究。在此背景下，码的LCPs安全参数被定义为该对偶中码的(汉明)距离及其对偶距离。我们研究了斜扭常循环码的LCPs性质，因为其代数结构为研究其对偶码和距离提供了工具。由此，我们给出了这类对偶码的刻画特征，以及多个可用于构造具有设计安全参数对偶码的结果。我们将斜扭BCH码推广至常循环语境，并证明斜扭BCH常循环码可直接用于构造LCPs码。此外，我们描述了斜扭常循环码集合中保持汉明重量的自同构群，该群可用于构造LCPs码。