On linear complementary pair of codes

Official URL: https://risc01.sabanciuniv.edu/record=b2486389 _(Table of contents)

Linear complementary pair (C,D) of codes has drawn much attention recently due to their applications to cryptography, in the context of side channel and fault injection attacks. The security parameter of such a pair is defined to be the minimum of the minimum distances d(C) and d(D?). Carlet et al. showed that if C and D are both cyclic or both 2D cyclic over a finite field, then C and D? are equivalent codes. Hence d(C) = d(D?). We extend this result to all nD cyclic, or abelian, codes over finite fields. Moreover, we prove the same result for all linear complementary pair of 2-sided group codes over finite chain rings