Linear Complementary Pair Of Abelian Codes over Finite Chain Rings
Preprint
Abstract
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 cryptography, in the context of side-channel and fault injection attacks. The security parameter for an LCP of codes $(C,D)$ is defined as the minimum of the minimum distances $d(C)$ and $d(D^\bot)$. It has been recently shown that if $C$ and $D$ are both abelian codes over a finite field $\mathbb F_q$, and the length of the codes is relatively prime to $q$, then $C$ and $D^\bot$ are equivalent. Hence the security parameter for an LCP of abelian codes $(C,D)$ is simply $d(C)$. In this work, we first extend this result to the non-semisimple case, i.e. the code length is divisible by the characteristic of the field of definition. Then we use the result over the finite fields to prove the same fact for an LCP of abelian codes over any finite chain ring.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- A note on linear complementary pairs of group codesDiscrete Mathematics, 2020
- Do non-free LCD codes over finite commutative Frobenius rings exist?Designs, Codes and Cryptography, 2020
- Linear complementary dual codes over ringsDesigns, Codes and Cryptography, 2019
- Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes overJournal of Pure and Applied Algebra, 2018
- Characterization and enumeration of complementary dual abelian codesJournal of Applied Mathematics and Computing, 2017
- LCD codes over finite chain ringsFinite Fields and Their Applications, 2015
- Multidimensional cyclic codes and Artin–Schreier type hypersurfaces over finite fieldsFinite Fields and Their Applications, 2006
- On the Structure of Linear and Cyclic Codes over a Finite Chain RingApplicable Algebra in Engineering, Communication and Computing, 2000
- The condition for a cyclic code to have a complementary dualDiscrete Mathematics, 1994
- Linear codes with complementary dualsDiscrete Mathematics, 1992